99.9LGMar 16
From Entropy to Epiplexity: Rethinking Information for Computationally Bounded IntelligenceMarc Finzi, Shikai Qiu, Yiding Jiang et al. · openai
This work addresses foundational issues in information theory for machine learning practitioners, offering a new framework for data selection and transformation, though it is incremental in building on existing concepts.
100.0STMar 29
Learning general conditional independence structures via the neighbourhood latticeArash A. Amini, Bryon Aragam, Qing Zhou
This work addresses the problem of learning multivariate dependencies in nonparametric and high-dimensional settings, offering a unified approach that works without faithfulness and avoids the curse of dimensionality.
99.9LGMar 20
Beyond Single Tokens: Distilling Discrete Diffusion Models via Discrete MMDEmiel Hoogeboom, David Ruhe, Jonathan Heek et al.
This addresses a bottleneck in discrete diffusion models for researchers and practitioners, enabling faster sampling while preserving performance.
99.7LGMay 13
TabPFN-3: Technical ReportLéo Grinsztajn, Klemens Flöge, Oscar Key et al.
For practitioners in science and industry needing fast, accurate tabular prediction, TabPFN-3 provides a foundation model that dominates the speed/performance frontier and scales to large datasets.
99.6LGMar 16Code
Chain-of-Trajectories: Unlocking the Intrinsic Generative Optimality of Diffusion Models via Graph-Theoretic PlanningPing Chen, Xiang Liu, Xingpeng Zhang et al.
This work addresses the problem of computational inefficiency in diffusion models for AI researchers and practitioners, offering a novel planning-based approach that is incremental in enhancing existing methods.
100.0MLMar 22
Proximal Point Nash Learning from Human FeedbackDaniil Tiapkin, Daniele Calandriello, Denis Belomestny et al.
This addresses the challenge of accurately capturing complex human preferences in AI alignment, offering a more stable alternative to traditional methods, though it appears incremental as it builds on existing Nash learning frameworks.
99.9MLApr 14
Discrete Flow MapsPeter Potaptchik, Jason Yim, Adhi Saravanan et al.
For large language model practitioners, this provides a method to overcome the speed bottleneck of autoregressive generation while maintaining quality, though it is an incremental improvement over existing flow models.
99.7MLMar 13
A theory of learning data statistics in diffusion models, from easy to hardLorenzo Bardone, Claudia Merger, Sebastian Goldt
This provides foundational insights into how diffusion models learn complex distributions, which is incremental but clarifies a key mechanism for the AI/ML community.
99.6MLMar 16
Structural Causal Bottleneck ModelsSimon Bing, Jonas Wahl, Jakob Runge
This provides a flexible framework for task-specific dimension reduction in causal inference, offering an alternative to existing methods like causal representation learning.
99.5MLJun 2
An Asymptotic Theory of Chain-of-Thought in In-Context LearningKaito Takanami, Cengiz Pehlevan
Provides a unified theoretical understanding of how test-time reasoning depth affects generalization in LLMs, addressing a poorly understood scaling behavior.
98.9LGMay 12
One-Step Generative Modeling via Wasserstein Gradient FlowsJiaqi Han, Puheng Li, Qiushan Guo et al.
For practitioners needing fast generative models, W-Flow provides a single-step generator that matches or exceeds the quality of iterative diffusion models while drastically reducing sampling time.
99.7DSMar 24
Algorithmic warm starts for Hamiltonian Monte CarloMatthew S. Zhang, Jason M. Altschuler, Sinho Chewi
This resolves the computational bottleneck of finding warm starts for HMC, which is crucial for practitioners in statistics, engineering, and sciences who rely on HMC for high-dimensional sampling, though it is incremental as it builds on prior theoretical work.
98.9LGApr 7
In-Place Test-Time TrainingGuhao Feng, Shengjie Luo, Kai Hua et al.
This addresses the limitation of static 'train then deploy' paradigms for LLMs in real-world tasks, representing an incremental but practical enhancement to existing TTT approaches.
99.4MLMay 8
Semiparametric Efficient Test for Interpretable Distributional Treatment EffectsHoussam Zenati, Arthur Gretton
For researchers in causal inference and treatment effect estimation, DR-ME offers an interpretable and efficient test for distributional effects, addressing a gap in existing global kernel tests.
99.2MLMay 7
One Operator for Many Densities: Amortized Approximation of Conditioning by Neural OperatorsPanos Tsimpos, Edoardo Calvello, Ayoub Belhadji et al.
For researchers in probabilistic inference and Bayesian methods, this work provides theoretical foundations for amortized conditioning, potentially enabling foundation models for Bayesian inference.
98.5LGMar 24
Manifold Generalization Provably Proceeds Memorization in Diffusion ModelsZebang Shen, Ya-Ping Hsieh, Niao He
This provides a theoretical foundation for generalization in diffusion models, addressing a key gap in understanding their behavior beyond density estimation, which is important for researchers in generative modeling.
99.1MLMay 28
Reward Learning from Best-of-$N$ Preference Data: Targets, Tradeoffs, and Design PrinciplesRattana Pukdee, Maria-Florina Balcan, Pradeep Ravikumar
This work provides clarity on the theoretical underpinnings and practical design choices for researchers and practitioners using Best-of-N preference data in reward learning, particularly in areas like reinforcement learning from human feedback.
98.5LGApr 1Code
Online Reasoning Calibration: Test-Time Training Enables Generalizable Conformal LLM ReasoningCai Zhou, Zekai Wang, Menghua Wu et al.
This work addresses inefficiencies in LLM deployment for reasoning tasks, offering a method to reduce compute costs while maintaining performance, though it is incremental as it builds on conformal prediction and test-time training.
99.0MLMay 25Code
DiscoverPhysics: Benchmarking LLMs for Out-of-the-Box Scientific ThinkingMatt L. Wiemann, Lindsay M. Smith, Peter Melchior et al.
For AI researchers evaluating LLM reasoning, this benchmark reveals that current models struggle with long-horizon experimental design and hypothesis revision, especially when latent variables are involved.
98.4LGMar 27
Sharp Capacity Scaling of Spectral Optimizers in Learning Associative MemoryJuno Kim, Eshaan Nichani, Denny Wu et al.
This work provides a quantitative understanding of spectral optimizers for researchers in machine learning, though it is incremental as it builds on existing methods in a tractable model.