#sequence-generation News & Analysis

9 articles tagged with #sequence-generation. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

9 articles

AINeutralarXiv – CS AI · Jun 256/10

🧠

Attractive and Repulsive Pattern Control in Sequence Generation

Researchers introduce a signed pattern control mechanism for variable-order Markov sequence generation that reduces unwanted repetition and controls text generation quality through weighted recurrence automata and belief propagation sampling. Testing on musical sequences from Bach, Telemann, and jazz databases demonstrates the method effectively decreases self-reuse while maintaining coherence and training data fidelity.

AINeutralarXiv – CS AI · Jun 95/10

🧠

EditSR: Enhancing Neural Symbolic Regression via Edit-based Rectification

EditSR introduces a two-layer framework that combines neural symbolic regression with an edit-based rectification system to improve the accuracy of mathematical expression generation. The approach addresses error accumulation in autoregressive decoding by using a pretrained Rectifier that performs state-by-state edits while maintaining syntactic validity, achieving better results on complex expressions without significant computational overhead.

AINeutralarXiv – CS AI · Jun 26/10

🧠

Variational Learning for Insertion-based Generation

Researchers introduce the Insertion Process (IP), a novel generative model that learns optimal insertion orders for variable-length sequence generation, moving beyond fixed-length masked diffusion approaches. The framework uses permutation-based variational inference to jointly optimize what, where, and when to insert tokens, demonstrating improvements in goal-conditioned planning and molecular generation tasks.

AINeutralarXiv – CS AI · May 275/10

🧠

BrickAnything: Geometry-Conditioned Buildable Brick Generation with Structure-Aware Tokenization

BrickAnything is a new AI framework that generates physically buildable brick structures from 3D shapes by combining geometric reconstruction with structural constraints. The method uses structure-aware tokenization to model how bricks attach to each other, improving the feasibility and stability of generated designs compared to existing heuristic approaches.

AINeutralarXiv – CS AI · May 115/10

🧠

Exact Regular-Constrained Variable-Order Markov Generation via Sparse Context-State Belief Propagation

Researchers present a novel computational method for generating sequences constrained by regular automata using variable-order Markov models. The advancement eliminates the need to expand full K-tuple state spaces while maintaining exact inference, achieving linear complexity for fixed models and enabling efficient constrained sequence generation across applications.

AINeutralarXiv – CS AI · May 116/10

🧠

Prune-OPD: Efficient and Reliable On-Policy Distillation for Long-Horizon Reasoning

Researchers introduce Prune-OPD, a framework that optimizes on-policy distillation for AI reasoning models by detecting when student predictions diverge from teacher guidance and dynamically truncating unreliable training sequences. The method reduces training time by 37-68% on challenging math benchmarks while maintaining or improving performance.

AIBullisharXiv – CS AI · May 16/10

🧠

Simple Self-Conditioning Adaptation for Masked Diffusion Models

Researchers propose Self-Conditioned Masked Diffusion Models (SCMDM), a post-training adaptation that improves discrete sequence generation by conditioning each denoising step on previous predictions rather than discarding them. The method achieves nearly 50% perplexity reduction on language models and demonstrates improvements across image synthesis, molecular generation, and genomic modeling without requiring architectural changes or extra computational costs.

🏢 Perplexity

AIBullisharXiv – CS AI · Mar 36/104

🧠

RL for Reasoning by Adaptively Revealing Rationales

Researchers introduce AdaBack, a new reinforcement learning algorithm that uses partial supervision to help AI models learn complex reasoning tasks. The method dynamically adjusts the amount of guidance provided to each training sample, enabling models to solve mathematical reasoning problems that traditional supervised learning and reinforcement learning methods cannot handle.

AIBullisharXiv – CS AI · Mar 44/103

🧠

Efficient Self-Evaluation for Diffusion Language Models via Sequence Regeneration

Researchers propose DiSE, a self-evaluation method for diffusion large language models (dLLMs) that quantifies confidence by computing token regeneration probabilities. The method enables more efficient quality assessment and introduces a flexible-length generation framework that adaptively controls sequence length based on the model's self-assessment.