atlas

Research map / Learning theory and algorithms / Sample complexity

Learning Parametric Distributions from Samples and Preferences

ICML 2025 · Learning theory and algorithms › Sample complexity · approach: Minimax estimation rates · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Studies when preference feedback (log-probability-based preferences over sample pairs) improves parameter estimation for continuous parametric distributions, showing M-estimators gain asymptotic variance and a constraint-based estimator achieves O(1/n) error under deterministic preferences, matched by a lower bound.

Problem

Parameter estimation for continuous parametric distributions when the learner observes sample pairs plus preferences (from log-probability rewards) depending on the same unknown parameter; whether preferences improve estimation over sample-only MLE.

Approach

Under deterministic preferences, the preference labels impose hard feasibility constraints on the parameter; estimators that minimize the empirical 0-1 preference loss (or minimize sample NLL within the feasible set) achieve an accelerated O(1/n) rate, versus the Theta(1/sqrt(n)) rate of M-estimators, with a matching minimax lower bound.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add stochastic preference feedback to sample-only estimationStochastic preference MLE · Gaussian and Laplace distributions with log-probability preferencesasymptotic varianceHelped
use deterministic rather than stochastic preferencesPreference-based M-estimator · Gaussian and Laplace distributions with log-probability preferencesasymptotic varianceHelped
use stochastic preference MLE instead of sample-only MLEGaussian and Laplace distributions with log-probability preferences · Asymptotic estimationasymptotic varianceHelped
use deterministic preference M-estimation instead of sample-only MLEGaussian distributions · Finite-sample estimationestimation errorHelped
use stochastic preference MLE instead of sample-only MLEGaussian distributions · Finite-sample estimationestimation errorHurt
constrain the sample-only MLE to the deterministic-preference feasible setDP MLE · Gaussian distributionsestimation errorHelped
use a feasible-set estimator instead of DP MLEArbitrary feasible estimator and worst-case feasible estimator · Gaussian distributions, larger dimensionsestimation errorHurt
increase dimension at fixed sample sizeArbitrary feasible estimator and worst-case feasible estimator · Gaussian distributionsestimation errorHurt
use deterministic preference constraints rather than M-estimationFeasible-set estimators · Gaussian distributionsestimation error rate: \cO(1/\sqrt{n}) -> \cO(1/n)Helped

Surprising findings

Limitations

Experimental setup

Datasets: synthetic Gaussian samples synthetic Laplace samples

Metrics: estimation error ||theta_hat - theta*|| asymptotic variance minimax lower bound

Baselines: sample-only MLE stochastic preference MLE logistic-loss preference MLE (lle)

Builds on: Bradley-Terry model M-estimation theory Assouad's lemma

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy