ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “constrained inference”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

stat.MLcs.LGRecentJun 2, 2026

Resource-Constrained Adaptive Inference for Sequential Pricing

Ruicheng Ao, Jiashuo Jiang, David Simchi-Levi

The paper addresses the failure of fixed-price inference in resource-constrained pricing controllers by developing a target-aware controller that tracks local densities and provides certified, shrinki…

View →
cs.CLcs.AIRecentMay 30, 2026

EPIC: Efficient and Parallel Inference under CFG Constraints for Diffusion Language Models

Hyundong Jin, Yo-Sub Han

The paper proposes EPIC, an efficient and parallel decoding framework that significantly speeds up the process of constraining diffusion language model outputs using Context-Free Grammars (CFG).

View →
stat.MLcs.AIcs.LGRecentMay 28, 2026

Improved Distribution Estimation in $\ell_\infty$

Doron Cohen, Aryeh Kontorovich, Yonatan Livshitz

This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.

View →
cs.IRcs.AIcs.LGEmpiricalRecentJun 26, 2026

End-to-End Dynamic Sparsity for Resource-Adaptive LLM Inference

Yuhang Chen, Jinhao Duan, Ruichen Zhang, Mingfu Liang +10 more

This paper proposes Learning to Allocate (L2A), an end-to-end framework for resource-adaptive inference in Large Language Models (LLMs) using budget-conditioned and input-aware gating networks.

View →
cs.PLcs.LGTheoreticalRecentJul 8, 2026

GradInf: Gradient Estimation as Probabilistic Inference

Gaurav Arya, Mathieu Huot, Moritz Schauer, Alexander K. Lew +1 more

This paper introduces gradient inference, a new approach to developing sound and efficient gradient estimators for probabilistic programs by reducing gradient estimation to a related probabilistic inf…

View →
cs.ITcs.AIcs.LGRecentMay 30, 2026

Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation

Munsik Kim

The paper establishes information-theoretic lower bounds for stochastic optimization using low-bit gradients by reducing the problem to compressed Gaussian mean estimation, yielding sharp bounds on co…

View →
stat.MLcs.LGmath.PRTheoreticalRecentJul 7, 2026

A Convex Approximation Framework for Neural Likelihood-Based Bayesian Inverse Problems

Fabian Schneider, Tapio Helin, Leila Taghizadeh

This paper improves the foundations of neural likelihood approximation for Bayesian inverse problems by making the learning problem strictly convex and showing convergence to the true likelihood.

View →
math.STcs.ITmath.CTTheoreticalRecentJun 19, 2026

Reformulation Invariance and the Axiomatic Foundations of Inference

Raphaël Trésor, Thijs van de Laar, Bert de Vries

This paper argues that the choice of divergence in statistical inference can be justified by requiring invariance to problem reformulations, leading to the selection of the Kullback-Leibler divergence…

View →
cs.LGTheoreticalRecentJun 22, 2026

On the Limits of Prompt-Conditioned Language Models as General-Purpose Learners

David Mguni, Julian Ma, Jun Wang

This paper argues that large language models have fundamental limitations as general-purpose solvers due to the capacity-limited nature of language as a communication channel and alignment constraints…

View →
cs.AIcs.LGRecentJun 1, 2026

Extreme Low-Bit Inference in Reasoning Models: Failure Modes and Targeted Recovery

Ekaterina Alimaskina, Darya Rudas, Denis Shveykin, Gleb Molodtsov +2 more

The paper analyzes the failure modes of aggressive 2-bit quantization in large reasoning models, proposing lightweight controls like FP16 planning and loop rescue to restore accuracy and achieve pract…

View →
math.OCcs.AIcs.LGRecentJun 1, 2026

MINTS: Minimalist Thompson Sampling

Kaizheng Wang

The paper introduces MINTS, a minimalist Bayesian framework that simplifies sequential decision-making by placing priors only on the optimum location, allowing for the incorporation of structural cons…

View →
cs.CRcs.PLRecentMay 28, 2026

A Bayesian Approach to Membership Inference for Statistical Release

Lisa Oakley, Sam Stites, Cameron Moy, Steven Holtzen +2 more

This paper proposes a Bayesian framework to enhance membership inference attacks against released statistics by incorporating prior knowledge about the population's attribute dependency structure, out…

View →
cs.SEcs.CLSurveyRecentJun 18, 2026

Token-Operations-Oriented Inference Optimization Techniques for Large Models

Shiguo Lian, Kai Wang, Zhaoxiang Liu, Wen Liu +21 more

This paper proposes a four-layer technical architecture for large model inference optimization, including Multi-model Fusion, Model Optimization, Compute-Model Fusion, and Compute-Network-Model Fusion…

View →
cs.LGcs.AImath.OCRecentMay 29, 2026

Unlearning in Diffusion Models: A Unified Framework with KL Divergence and Likelihood Constraints

Shervin Khalafi, Alejandro Ribeiro, Dongsheng Ding

The paper proposes a unified, constrained optimization framework using KL divergence and likelihood constraints to achieve effective and principled unlearning in diffusion models.

View →
cs.ITcs.CRmath.STRecentMar 21, 2026

Composition Theorems for Multiple Differential Privacy Constraints

Cemre Cadir, Salim Najib, Yanina Y. Shkel

The paper develops a general framework to exactly characterize the composition of mechanisms satisfying multiple differential privacy constraints, extending known results to arbitrary numbers of const…

View →
cs.LGcs.CRcs.ITRecentMay 21, 2026

Optimal Guarantees for Auditing Rényi Differentially Private Machine Learning

Benjamin D. Kim, Lav R. Varshney, Daniel Alabi

The paper introduces an optimal black-box auditing framework using Donsker-Varadhan estimators to estimate Rényi differential privacy (RDP) guarantees for machine learning algorithms.

View →
cs.PLTheoreticalRecentJul 22, 2026

Generalized Constraint Projection: Four-Dimensional Type Inference for Dynamic Languages

Qunhui Zhang

This paper introduces Generalized Constraint Projection (GCP), a zero-annotation inference framework for dynamically typed languages, which separates sources of evidence for function parameters and pr…

View →