20 results for “Nested sampling”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper provides a comprehensive derivation and exposition of the nested sampling technique, clarifying its theoretical foundations and practical challenges.
This paper introduces survey sampling techniques to estimate or minimize empirical pairwise loss functions, showing that targeting informative pairs significantly reduces computational cost while main…
This paper formalizes test-time training (TTT) as a problem of sampling from a given probability measure and shows a quadratic lower bound on the query complexity of sampling.
This paper investigates the use of strategically diverse data in self-training for LLMs, showing that diversity of approaches can matter more than correctness or teacher scale.
The paper introduces novel, efficient differentially private algorithms for estimating monotone statistics, significantly improving sample complexity compared to existing methods.
Badih Ghazi, Cristóbal Guzmán, Pritish Kamath, Alexander Knop +2 more
The paper studies the problem of generating synthetic data under differential privacy and achieves fixed-parameter tractability.
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…
One clear sentence describing what this paper does
The paper introduces Entropy-Cut Metropolis-Hastings, an efficient sampling method that uses next-token entropy to identify and resample from critical decision points in a reasoning trace, significant…
This paper presents a self-balancing sampler for sequential sampling that achieves faster convergence to a desired target law while maintaining unpredictability.
This paper presents a stable coreset of size O(ε^-2 log 1/ε) for the geometric median problem, which preserves the cost of every candidate solution and handles structural constraints.
Develops a max-risk objective for active learning in multi-group mean estimation d-armed bandits and proves a lower bound for this objective.
The paper introduces a quotient-DAG view to accurately estimate unordered slate propensities for off-policy evaluation, solving the nuisance variance and computational gap inherent in standard importa…