20 results for “Likelihood optimization”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper proposes a unified, constrained optimization framework using KL divergence and likelihood constraints to achieve effective and principled unlearning in diffusion models.
This paper provides a comprehensive derivation and exposition of the nested sampling technique, clarifying its theoretical foundations and practical challenges.
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…
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.
Proposes CR-EA-C, a confidence-driven evolutionary algorithm for solving noisy black-box optimization problems under joint chance constraints.
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.
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,…
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.
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.
The paper presents a framework for model selection and parameter estimation using large language models and neural simulation-based inference.
This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.
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…
This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.
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.
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…
This paper studies high-dimensional graph combinatorial hypothesis testing problems and characterizes statistical and computational thresholds for signal magnitude required for strong detection.