Discrete Autoregressive Transformer for Generative Mechanism Synthesis

• URL: http://arxiv.org/abs/2606.17409v1
• Date: Tue, 16 Jun 2026 01:46:21 GMT
• Title: Discrete Autoregressive Transformer for Generative Mechanism Synthesis
• Abstract summary: Planar path synthesis requires mechanisms whose coupler curves match a prescribed trajectory.<n>We report Chamfer distance and dynamic time warping after forward kinematics and geometric alignment.<n>We formulate synthesis as conditional autoregressive sequence modeling.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Planar path synthesis requires mechanisms whose coupler curves match a prescribed trajectory; the mapping from curve to linkage is inherently one-to-many across four-, six-, and eight-bar topologies. We address this design problem with simulation-grounded evaluation on a curated corpus of over one million mechanisms, reporting Chamfer distance and dynamic time warping after forward kinematics and geometric alignment. We formulate synthesis as conditional autoregressive sequence modeling: joint coordinates are uniformly quantized to tokens and generated by a decoder-only transformer with a variational-autoencoder (VAE) latent of the target curve and an explicit mechanism-type token. Training combines token cross-entropy with a Gaussian-smoothed bin auxiliary loss that respects ordinal structure among bins. At inference, a bounded latent-noise schedule decodes all mechanism types at each noise level; we retain the top five candidates by geometric error, yielding diverse accurate families without dataset lookup. On held-out tests, aggregate mean Chamfer distance is $0.0132$ and mean dynamic time warping is $0.153$; a latent $k$-nearest-neighbor baseline that conditions on training-set neighbor latents in VAE space achieves matched-topology mean Chamfer distance $0.0071$ and mean dynamic time warping $0.117$ using the same decoder.

Related papers

• Model-level synthetic-flux control of hyperchaos order and matched-resource sensing in dissipative optomechanics [0.11545092788508222]
  We present a synthetic-flux phase $_rm syn$ control coordinate that selects the emphorder of a drive- and coupling-gated hyperchaos transition.<n>A phase-consistent Floquet--Lyapunov protocol (cross-checked by monodromy multipliers, dissipative volume balance $sum_i=nameTr(J)=-1.04$ and a 180-run three-seed audit) localizes the onset to a Neimark--Sacker bifurcation at $E*=num1.060
  arXiv  Detail & Related papers  (2026-09-02T17:13:43Z)
• GrainGS: Gradient-Decoupled Gaussian Splatting for Efficient Dynamic Novel View Synthesis [94.20462261657525]
  GrainGS is a dynamic framework that combines a hierarchical anchor scaffold with per-Gaussian deformation.<n>It achieves high reconstruction quality, real-time novel view synthesis, and compact storage.
  arXiv  Detail & Related papers  (2026-07-23T15:52:35Z)
• Deep learning-based prediction of time-resolved adhesive forces in viscoelastic Hertzian contacts [0.0]
  We train a stateful, sequence-to-sequence deep learning model to predict the full force evolution from a prescribed displacement history.<n>The model is tested across unseen parameter combinations and against analytical limiting cases.<n>It provides a rapid surrogate for repeated numerical evaluations with potential use in control-oriented applications.
  arXiv  Detail & Related papers  (2026-07-21T12:48:48Z)
• Closed-Form Spectral Regularization for Multi-Task Model Merging [96.82449201305234]
  Model merging combines several independently fine-tuned experts into a single multi-task model without any training data.<n>State-of-the-art merging methods formulate merging as a layer-wise interference problem.<n>We propose SWUDI, a closed-form method that combines a soft exponential filter, which matches the gradient-flow trajectory of iterative descent.
  arXiv  Detail & Related papers  (2026-06-05T14:00:47Z)
• CAWN: Continuous Acoustic Wave Networks for Autoregressive Language Modeling [46.16066322190728]
  We introduce the Continuous Acoustic Wave Network (CAWN), a fully continuous sequence-mixing architecture.<n>Instead of discrete matrix-based attention, CAWN projects hidden states into multi-headed complex-domain phasors.<n>To prevent signal degradation over ultra-long contexts, we introduce a dual-gated Selective Phase Resonance mechanism.
  arXiv  Detail & Related papers  (2026-04-05T20:13:22Z)
• Spectral Edge Dynamics of Training Trajectories: Signal--Noise Geometry Across Scales [0.0]
  We show that transformer training trajectories evolve within only a few coherent directions.<n>In companion work, the same spectral geometry provides early-warning signals of grokking.
  arXiv  Detail & Related papers  (2026-03-14T04:46:05Z)
• Hardware-Agnostic Modeling of Quantum Side-Channel Leakage via Conditional Dynamics and Learning from Full Correlation Data [0.0]
  We study a sequential side-channel model in which an adversarial probe qubit interacts with a target qubit during a hidden gate sequence.<n>Repeating the same hidden sequence for $N$ shots yields an empirical full-correlation record.<n>Experiments over broad coupling and noise grids show that strict sequence recovery concentrates near the predicted coupling band.
  arXiv  Detail & Related papers  (2026-02-17T19:33:23Z)
• Intelligent Control of Collisional Architectures for Deterministic Multipartite State Engineering [0.0]
  We introduce an intelligent, constraint-aware control framework for deterministic generation of symmetric Dicke states $|D_n(m)rangle$ in repeated excitation-within-interaction architectures.<n>The protocol employs partialSWAP collisions between two disjoint qubit registers, mediated by $m$ ancillary shuttle'' qubits, and poses Dickestate preparation as a emph-loop design problem.
  arXiv  Detail & Related papers  (2026-02-09T11:15:32Z)
• Inverting Self-Organizing Maps: A Unified Activation-Based Framework [39.146761527401424]
  We show that the activation pattern of a SOM can be inverted to recover the exact input under mild geometric conditions.<n>We introduce the Manifold-Aware Unified SOM Inversion and Control (MUSIC) update rule.<n>We validate the approach using synthetic Gaussian mixtures, the MNIST and the Faces in the Wild dataset.
  arXiv  Detail & Related papers  (2026-01-20T11:02:54Z)
• Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency [52.60557300927007]
  We present a $textbfMA-OSMA$ algorithm to transfer the discrete submodular problem into a continuous optimization.<n>We also introduce a projection-free $textbfMA-OSEA$ algorithm, which effectively utilizes the KL divergence by mixing a uniform distribution.<n>Our algorithms significantly improve the $(frac11+c)$-approximation provided by the state-of-the-art OSG algorithm.
  arXiv  Detail & Related papers  (2025-02-07T15:57:56Z)
• Can Transformers Do Enumerative Geometry? [44.99833362998488]
  We introduce a Transformer-based approach to computational enumerative geometry.<n>We compute intersection numbers across a value range from $10-45$ to $1045$.<n>We show that the network is implicitly modeling the Virasoro constraints in a purely data-driven manner.
  arXiv  Detail & Related papers  (2024-08-27T09:44:01Z)
• Predicting the Stability of Hierarchical Triple Systems with Convolutional Neural Networks [68.8204255655161]
  We propose a convolutional neural network model to predict the stability of hierarchical triples. All trained models are made publicly available, allowing to predict the stability of hierarchical triple systems $200$ times faster than pure $N$-body methods.
  arXiv  Detail & Related papers  (2022-06-24T17:58:13Z)
• NeuroMorph: Unsupervised Shape Interpolation and Correspondence in One Go [109.88509362837475]
  We present NeuroMorph, a new neural network architecture that takes as input two 3D shapes. NeuroMorph produces smooth and point-to-point correspondences between them. It works well for a large variety of input shapes, including non-isometric pairs from different object categories.
  arXiv  Detail & Related papers  (2021-06-17T12:25:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.