Research library

Search papers on equipment connectivity, quality inspection, production analysis, and manufacturing work.

Search and filter

New paper summaries

Summaries are editorial notes, not statements by the original authors. Check the original paper. Updated 2026-11-20.

  1. 339LLMs / NLP

    You Only Index Once: Cross-Layer Sparse Attention with Shared Routing

    • It proposes CLSA, which shares routing indices across layers in a KV-sharing architecture.
    • A single indexer performs top-k selection once and reuses the result across all layers.
    • It amortizes routing cost while preserving the accuracy of token-sparse attention.
    • It improves all major inference bottlenecks at once, including prefilling, KV cache, and decoding.
    • It achieves a 7.6x decoding speedup and a 17.1x overall throughput gain at 128K context length.
  2. 338AI / General

    Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement

    • It uses a strategy that generates and refines blueprints, which are dependency graphs of definitions and lemmas.
    • Instead of recursive lemma decomposition, it avoids dead-end loops through parallel proofs and global refinement.
    • It uses DeepSeek-V4-Flash, a 284B-A13B open model, as the backbone.
    • It achieves 100 percent on MiniF2F-test, 88.8 percent on PutnamBench, 4 out of 6 on IMO 2025, and 11 out of 12 on Putnam 2025.
    • It reaches state of the art at up to 500 times lower cost than similar open-source pipelines.
  3. 337Statistics

    How abundant are good interpolators?

    • It establishes a large-deviation principle for the generalization error when a classifier is chosen at random from the set of interpolating classifiers.
    • It shows that almost all interpolating classifiers concentrate exponentially around the same generalization performance.
    • The analysis is carried out on two natural distributions: Gaussian mixture models and logistic models.
    • In the overparameterized regime, gradient descent and linear programming outperform random interpolators.
    • The result suggests that benign overfitting in practical algorithms is a nontrivial phenomenon rather than something obvious.
  4. 336Machine Learning

    PC Layer: Polynomial Weight Preconditioning for Improving LLM Pre-Training

    • A low-order polynomial preconditioner stabilizes the singular value spectrum of the weight matrices.
    • The trained weights are merged back into the original architecture, so there is no inference overhead.
    • On Llama-1B, it improves performance over the standard transformer for both AdamW and Muon.
    • Theoretically, it guarantees geometric convergence of gradient descent when layerwise singular values are uniformly bounded.
    • It can be applied to existing LLM training pipelines without extra parameters or architectural changes.
  5. 335AI / General

    MLEvolve: A Self-Evolving Framework for Automated Machine Learning Algorithm Discovery

    • It uses Progressive MCGS to enable information flow across branches, solving the isolation problem of existing tree search.
    • Retrospective Memory jointly uses domain knowledge and task experience.
    • An adaptive coding mode that separates strategy planning from code generation improves stability in long iterative loops.
    • It achieves state-of-the-art mean medal rate and valid submission rate on MLE-Bench with a 12-hour budget, which is half the standard budget.
    • It outperforms AlphaEvolve on mathematical algorithm optimization and shows strong cross-domain generalization.
  6. 334LLMs / NLP

    Self-Augmenting Retrieval for Diffusion Language Models

    • It uses low-confidence tokens discarded during denoising as a lookahead signal for retrieval.
    • It is training-free, retriever-agnostic, and applicable to all discrete diffusion language models.
    • It exploits the fact that low-confidence tokens surface key entities before the output is complete.
    • It outperforms existing baselines on five multi-hop QA benchmarks.
    • It achieves up to 8x higher throughput than prior methods.
  7. 333Machine Learning

    RREDCoT: Segment-Level Reward Redistribution for Reasoning Models

    • The method addresses the delayed-reward problem in chain-of-thought reasoning through segment-level reward redistribution.
    • We use the model itself to approximate optimal reward redistribution without additional generation.
    • This greatly reduces computational overhead compared with Monte Carlo sampling.
    • We perform credit assignment by identifying CoT segments that contribute to reaching the correct answer.
    • We systematically analyze design choices for CoT segmentation and state-value estimation.
  8. 332Machine Learning

    Pretraining Recurrent Networks without Recurrence

    • It reduces RNN training to supervised learning over stepwise memory transitions and bypasses recurrent backpropagation.
    • It learns what to remember by generating memory labels with a Transformer-based encoder.
    • It captures long-range dependencies stably with an O(1) gradient path between every token pair.
    • It enables parallel training along the time axis, which has the potential to remove the bottleneck in scaling RNNs.
    • It outperforms standard BPTT on language modeling and pixel sequence modeling.
  9. 331Game Theory

    DNQ: Deep Nash Q-Network for Partially Observable n-Player Games

    • It trains bidding agents with a solver-in-the-loop equilibrium supervision framework.
    • A shared critic predicts a pairwise payoff matrix or an N-player payoff tensor to improve training efficiency.
    • The pairwise formulation greatly reduces compute cost compared with the exact N-player formulation.
    • The exact method becomes computationally infeasible as the number of agents increases.
    • It empirically shows the tradeoff between strategic fidelity and scalability.
  10. 330LLMs / NLP

    Operation-Guided Progressive Human-to-AI Text Transformation Benchmark for Multi-Granularity AI-Text Detection

    • The paper proposes OpAI-Bench, a benchmark that models the nine-stage progressive human-to-AI co-editing process.
    • It evaluates AI-text detectors at four granularities: document, sentence, token, and span.
    • It covers five representative AI editing operations across four domains.
    • It finds non-monotonic patterns in which intermediate versions of mixed-authorship text are harder to detect than either fully human text or high-ratio AI text.
    • AI detectability depends on the editing ratio, operation type, domain, and cumulative history.
  11. 329Machine Learning

    Regret Minimization with Adaptive Opponents in Repeated Games

    • It introduces RP-Regret, a new metric for repeated games with adaptive opponents.
    • RP-Regret is fundamentally a nonconvex problem, and the paper proposes three algorithms to address it.
    • When all players minimize RP-Regret, they can learn a subgame-perfect equilibrium.
    • On the Stag-Hunt game, the methods converge to more cooperative and higher-utility solutions than existing approaches.
    • It identifies necessary conditions on the memory of comparison strategies and opponent strategies.
  12. 328Robotics

    TempoVLA: Learning Speed-Controllable Vision-Language-Action Policies

    • Existing VLA models learn only fixed speeds, but TempoVLA controls execution speed with an explicit speed condition.
    • VSTA augmentation preserves motion semantics while retiming demonstrations at arbitrary speeds.
    • It achieves bidirectional flexible speed control in both simulation and the real world.
    • Combined with a large multimodal model, it enables risk-aware dynamic speed control.
    • VSTA also improves the base 1x-speed performance by increasing data utilization.
  13. 327Software Engineering

    Code2LoRA: Hypernetwork-Generated Adapters for Code Language Models under Software Evolution

    • A hypernetwork generates repository-specific LoRA adapters to inject repository knowledge at inference time without token overhead.
    • It supports two modes, Code2LoRA-Static for static snapshots and Code2LoRA-Evo for evolving codebases.
    • Code2LoRA-Evo adapts to commit-level diffs with a GRU hidden state.
    • It introduces RepoPeftBench, a new benchmark built from 604 Python repositories.
    • It comes close to the repository-specific LoRA upper bound with 66.2 percent exact match on the static track and 60.3 percent exact match on the evolving track.
  14. 326Robotics

    HANDOFF: Humanoid Agentic Task-Space Whole-Body Control via Distilled Complementary Teachers

    • We propose a concise, modular interface between task planning and whole-body control.
    • We distill three experts, whole-body motion tracking, locomotion, and fall recovery, into a mixture of experts.
    • We achieve SOTA speed tracking and a wide manipulation workspace on Unitree G1 hardware.
    • A VLM-based agent planner enables control through natural-language commands.
    • It performs a wide range of tasks without task-specific data or controller fine-tuning.
  15. 325Machine Learning

    TailLoR: Protecting Principal Components in Parameter-Efficient Continual Learning

    • It designs low-rank updates by using the singular-value basis, U and V, of the pretrained weights as a fixed reference frame.
    • A soft spectral penalty suppresses updates along principal-component directions to reduce interference between tasks.
    • Fine-grained adaptation is routed into the long-tail spectral coordinates that have higher flexibility.
    • It improves continual-learning performance for PEFT methods based on spectral decomposition.
  16. 324LLMs / NLP

    Self-Evaluation Is Already There: Eliciting Latent Judge Calibration in Base LLMs with Minimal Data

    • This paper finds that the capability is generally present even before any targeted training. With only a few-shot prompt, the base model already predicts multi-attribute quality scores from an external judge on open-ended responses across three benchmarks far above chance.
    • From just 160 unique examples, about 31 times fewer than the RL baseline, SEE improves held-out calibration across three benchmarks while preserving answer quality.
    • These results recast judge-aligned self-evaluation as a problem of extraction rather than acquisition.
  17. 323Computer Vision

    Geometry Gaussians: Decoupling Appearance and Geometry in Gaussian Splatting

    • Since the success of 3D Gaussian Splatting (3DGS) for novel view synthesis, many works have explored how to use it for geometric surface representations as well.
    • This study shows that base 3DGS is inherently ill-suited to represent texture and geometry at the same time by training with complete ground-truth texture and geometry.
    • The authors also propose a simple solution that applies a single additional geometric opacity parameter to each splat and combines it with an optional transparency curation optimization pipeline.
  18. 322Machine Learning

    Preserving Data Privacy in Learning Causal Structure with Fully Homomorphic Encryption

    • This paper proposes a fully homomorphic encryption (FHE)-based method that keeps data encrypted during transmission and computation by performing calculations on ciphertexts.
    • It also shows that the method can be portably extended to support differential privacy, making it easy to scale beyond FHE.
    • Experimental results show that the method achieves high consistency and comparable causal structures to the plaintext version on the tested datasets.
  19. 321Machine Learning

    Towards Efficient and Evidence-grounded Mobility Prediction with LLM-Driven Agent

    • Supervised sequence models achieve high accuracy, but they require task-specific training and provide little transparency at the decision level.
    • This paper proposes a training-free LLM-driven agent framework that formulates next-location prediction as adaptive, evidence-controlled decision making.
    • Across three mobility datasets, AgentMob achieves the strongest overall performance among training-free LLM-based methods, and GPT-5.4 reaches 71.42 percent Acc@1 on BW, 33.14 percent on YJMob100K, and 33.50 percent on Shanghai ISP.
  20. 320Machine Learning

    Deep Embedded Multiplicative DMD for Algebra-Preserving Koopman Learning

    • Deep Koopman methods learn flexible coordinates, while structure-preserving methods enforce operator identities over a fixed dictionary.
    • The result is a finite transition map over the learned latent cells.
    • These results suggest a practical rule for Koopman learning: learn the coordinates, constrain the algebra.
  21. 319LLMs / NLP

    Activation-Based Active Learning for In-Context Learning: Challenges and Insights

    • However, this paper reports a negative result: MLP outputs, viewed through the lens of large activations or the first four moments, do not correlate with example quality or task performance.
    • Specifically, across all tasks and models tested, the absolute Spearman correlation coefficient reached only 0.33 at most, showing that activation-based sampling should not be used for in-context learning.
    • The authors hypothesize that this may be due to superposition, the phenomenon where models represent more features than they have dimensions, which suggests methods such as Sparse Autoencoders (SAEs) may be a promising direction.
  22. 318Machine Learning

    Generating Financial Time Series by Matching Random Convolutional Features

    • To mitigate this, recent approaches train generators to minimize the mismatch between non-learned feature representations of real and generated time series.
    • This paper shows that a generator trained by matching random SOCK features consistently outperforms signature-based and diffusion-based baselines across multiple small-sample financial datasets.
    • The authors further demonstrate SOCK's expressiveness on two-sample hypothesis testing and time-series classification tasks, where SOCK matches or surpasses existing unsupervised feature maps.
  23. 317Machine Learning

    BBOmix: A Tabular Benchmark for Hyperparameter Optimization of Unsupervised Biological Representation Learning

    • Deep unsupervised learning architectures, especially autoencoders, are increasingly used in this field for dimensionality reduction and representation learning.
    • To make large-scale unsupervised HPO research broadly accessible, the paper introduces BBOmix, the first open-source tabular benchmark for unsupervised representation learning on real biological data.
    • The benchmark includes 105,000 evaluations across four AE architectures and seven multi-omics modalities in the TCGA and SCHC datasets.
  24. 316Computer Vision

    GeM-NR: Geometry-Aware Multi-View Editing for Nonrigid Scene Changes

    • The paper demonstrates that the method can handle edits with large changes in geometry and appearance, which existing methods struggle with.
    • The authors perform extensive evaluations showing that the method improves consistency across a range of editing tasks, including generating a 3D representation of the edited scene.
    • Both quantitative and qualitative results indicate state-of-the-art performance in edit quality as well as geometric and photometric consistency across multiple viewpoints.
  25. 315Robotics

    HORIZON: Recoverability-Governed Curriculum for Physical-Domain Scaling

    • In on-policy learning, a new dynamic is useful only when it stays close enough to the current policy to generate corrective on-policy data instead of collapsing rollouts into irreversible failure.
    • Using quadruped locomotion as a physically challenging benchmark for embodied generalization, the paper introduces HORIZON, a checkpoint-based frontier curriculum that expands the physical domain only within the recoverability boundary of the current policy.
    • Taken together, the results frame physical-domain generalization as a continual-growth problem for embodied control and make recoverability the organizing principle for on-policy scaling.
  26. 314Machine Learning

    Failed Reasoning Traces Tell You What Is Fixable (But Not by Reading Them)

    • The paper argues that this throws away an important signal, because some failures come from unlucky sampling and can be helped by more rollouts, while other failures are structural and resist resampling regardless of budget.
    • The authors propose that failed reasoning traces encode recoverability structure, meaning an inference-time signature of which test-time intervention can rescue a given failure.
    • Three task-level trajectory features derived from the structure of available interventions recover this structure from the distributional signature of failed rollouts rather than from the text of the rollouts themselves.
  27. 313Computer Vision

    An Open-Source Two-Stage Computer Vision Pipeline for Fine-Grained Vehicle Classification using Vision Transformers

    • Evaluated on 3,805 annotated overtaking events collected from bike lanes in Ann Arbor, Michigan, the pipeline achieved 0.94 accuracy, and class-wise F1 scores ranged from 0.91 for minivans to 0.97 for SUVs.
    • Three of the four well-represented categories retained F1 scores above 0.90 even under domain shift.
    • The complete pipeline, including the inference script, training code, evaluation utilities, and model weights, is released as open-source software to support reproducibility and reuse across roadside video archives and bicycle safety research.
  28. 312Neural Networks

    Multi-Column RBF Neural Network Using Adaptive and Non-Adaptive Particle Swarm Optimization

    • Error correction, the state-of-the-art gradient-based learning method, chooses the optimal hidden units to improve accuracy.
    • Both ErrCor and PSO demonstrate improved results and competitive convergence.
    • Inspired by the success of MCRN, the authors propose two new approaches for improving PSO performance: multi-column RBFN with PSO, or MC-PSO, and multi-column RBFN with APSO, or MC-APSO.
  29. 311Machine Learning

    Reinforcement Learning from Rich Feedback with Distributional DAgger

    • The paper shows that RL methods using existing self-distillation objectives based on reverse KL or Jensen-Shannon do not guarantee monotonic policy improvement, meaning the update can increase the probability of worse actions even when the expert has higher reward.
    • In contrast, it shows that forward cross-entropy allows monotonic policy improvement and provides regret guarantees.
    • It also shows that this objective improves Pass@N by optimizing a lower bound on the teacher's weighted success likelihood.
  30. 310LLMs / NLP

    Streaming Communication in Multi-Agent Reasoning

    • The paper introduces StreamMA, a multi-agent reasoning system that reduces latency by streaming each reasoning step to downstream agents as soon as it is generated, thereby pipelining neighboring agents.
    • Across eight reasoning benchmarks spanning math, science, and code, two state-of-the-art LLMs, Claude Opus 4.6 and GPT-5.4, and three topologies, Chain, Tree, and Graph, StreamMA outperforms both baselines.
    • Beyond these contributions, the authors discover a 'step-level scaling law': increasing the number of steps per agent consistently improves both effectiveness and efficiency, and this is a new scaling dimension that is orthogonal to and composable with agent-count scaling.

From research to product use

Operating capabilities, pilots, and technologies in development are identified separately.

View technology