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

20 results for “Likelihood optimization”

CS papers only

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

Want pure semantic search? Try claim verification →

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 →
stat.COastro-ph.COastro-ph.IMTheoreticalRecentJun 16, 2026

Nested Sampling: A Critical and Comprehensive Theoretical Guide

Luca Martino, Fernando Llorente

This paper provides a comprehensive derivation and exposition of the nested sampling technique, clarifying its theoretical foundations and practical challenges.

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 →
cs.NEEmpiricalRecentSep 18, 2026

A Confidence-Driven Evolutionary Algorithm for Noisy Optimization with Joint Chance Constraints

Enrico Halim, Hemant Singh, Tapabrata Ray

Proposes CR-EA-C, a confidence-driven evolutionary algorithm for solving noisy black-box optimization problems under joint chance constraints.

View →
math.STstat.MLEmpiricalRecentJun 17, 2026

Optimal score function estimation via derivatives constraints

Thomas Bonis, Thanh Mai Pham Ngoc, Viet Chi Tran

The paper investigates score function estimation via empirical risk minimization, focusing on score-based generative modeling and the use of Sobolev balls to prevent overfitting.

View →
stat.MEeess.SPEmpiricalRecentJul 24, 2026

A Hierarchical Likelihood Model for Non-linear Inverse Problems under Additive and Multiplicative Noise

Nicolas Goeman, Pierre-Antoine Thouvenin, Pierre Chainais

This paper proposes a hierarchical Bayesian model and an efficient MCMC algorithm to tackle ill-posed inverse problems in the presence of non-linear forward models, additive and multiplicative noise,…

View →
stat.MEmath.OCstat.MLEmpiricalRecentJun 12, 2026

Joint Nuclear and $\ell_1$ Regularization for Logistic Matrix Regression with Applications to Brain Imaging

Damian Brzyski, Aaron Cohen, Zijian Wang, Mario Dzemidzic +2 more

Introduces a new convex optimization framework for logistic scalar-on-matrix regression with low-rank and sparse structures.

View →
stat.MLcs.LGEmpiricalRecentJun 12, 2026

Gradient boosting for extremes: sampling theory and application to insurance

Stéphane Lhaut, Olivier Lopez

This paper develops statistical learning theory for gradient boosting in Peaks-over-Threshold modeling using Generalized Pareto distributions, deriving error bounds and reducing gradient correlation.

View →
cs.LGstat.MLEmpiricalRecentJul 20, 2026

Program Synthesis for Simulation-Based Inference: Joint Model Selection and Parameter Estimation

Siddharth Mishra-Sharma

The paper presents a framework for model selection and parameter estimation using large language models and neural simulation-based inference.

View →
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

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 →
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.ITTheoreticalRecentJun 26, 2026

Deriving Approximate Message Passing from the Convex Gaussian Min-Max Theorem

Vikrant Malik, Babak Hassibi

This paper establishes a direct connection between Approximate Message Passing (AMP) and the Convex Gaussian Min-max Theorem (CGMT) for regularized linear regression and M-estimation.

View →
math.STstat.MEstat.MLRecentJun 4, 2026

Optimally taming biases in black-box models for efficient semiparametric estimation

Yihong Gu, Qishuo Yin, Tianxi Cai, Jianqing Fan

The paper proposes a new, optimal estimator for semiparametric inference that improves upon standard double machine learning (DML) rates by eliminating the first-order stochastic error of nuisance fun…

View →
math.STstat.MLTheoreticalRecentOct 30, 2026

On Statistical-Computational Gaps in Graph Combinatorial Testing Problems

Ikjun Choi, Pratik Patil, Alessandro Rinaldo

This paper studies high-dimensional graph combinatorial hypothesis testing problems and characterizes statistical and computational thresholds for signal magnitude required for strong detection.

View →