English
Related papers

Related papers: Making the Most of Your Samples

200 papers

Score-based diffusion models have achieved remarkable empirical success in generating high-quality samples from target data distributions. Among them, the Denoising Diffusion Probabilistic Model (DDPM) is one of the most widely used…

Machine Learning · Statistics 2025-12-16 Yuchen Jiao , Yuchen Zhou , Gen Li

We introduce several new estimation methods that leverage shape constraints in auction models to estimate various objects of interest, including the distribution of a bidder's valuations, the bidder's ex ante expected surplus, and the…

Econometrics · Economics 2019-12-17 Joris Pinkse , Karl Schurter

We study an online resource allocation problem under uncertainty about demand and about the reward of each type of demand (agents) for the resource. Even though dealing with demand uncertainty in resource allocation problems has been the…

Optimization and Control · Mathematics 2022-10-11 Negin Gorlezaei , Patrick Jaillet , Zijie Zhou

We consider the problem of cost-optimal utilization of a crowdsourcing platform for binary, unsupervised classification of a collection of items, given a prescribed error threshold. Workers on the crowdsourcing platform are assumed to be…

Machine Learning · Computer Science 2022-07-06 Yashvardhan Didwania , Jayakrishnan Nair , N. Hemachandra

In recent years, an increasing amount of data is collected in different and often, not cooperative, databases. The problem of privacy-preserving, distributed calculations over separated databases and, a relative to it, issue of private data…

Databases · Computer Science 2016-05-23 Philip Derbeko , Shlomi Dolev , Ehud Gudes , Jeffrey D. Ullman

We study an assortment optimization problem under a multi-purchase choice model in which customers choose a bundle of up to one product from each of two product categories. Different bundles have different utilities and the bundle price is…

Data Structures and Algorithms · Computer Science 2022-10-12 Xin Chen , Jiachun Li , Menglong Li , Tiancheng Zhao , Yuan Zhou

We consider the minimax estimation problem of a discrete distribution with support size $k$ under locally differential privacy constraints. A privatization scheme is applied to each raw sample independently, and we need to estimate the…

Statistics Theory · Mathematics 2017-08-02 Min Ye , Alexander Barg

We study the empirical likelihood approach to construct confidence intervals for the optimal value and the optimality gap of a given solution, henceforth quantify the statistical uncertainty of sample average approximation, for optimization…

Methodology · Statistics 2016-10-25 Henry Lam , Enlu Zhou

This paper discusses the revenue management (RM) problem to maximize revenue by pricing items or services. One challenge in this problem is that the demand distribution is unknown and varies over time in real applications such as airline…

Machine Learning · Computer Science 2024-05-09 Kazuma Shimizu , Junya Honda , Shinji Ito , Shinji Nakadai

We consider a setup in which confidential i.i.d. samples $X_1,\dotsc,X_n$ from an unknown finite-support distribution $\boldsymbol{p}$ are passed through $n$ copies of a discrete privatization channel (a.k.a. mechanism) producing outputs…

Machine Learning · Computer Science 2018-11-30 Adriano Pastore , Michael Gastpar

In this paper, we settle the problem of learning optimal linear contracts from data in the offline setting, where agent types are drawn from an unknown distribution and the principal's goal is to design a contract that maximizes her…

Computer Science and Game Theory · Computer Science 2026-05-28 Mikael Møller Høgsgaard

In a prophet inequality problem, $n$ independent random variables are presented to a gambler one by one. The gambler decides when to stop the sequence and obtains the most recent value as reward. We evaluate a stopping rule by the…

Data Structures and Algorithms · Computer Science 2023-11-16 Andrés Cristi , Bruno Ziliotto

The ``sample amplification'' problem formalizes the following question: Given $n$ i.i.d. samples drawn from an unknown distribution $P$, when is it possible to produce a larger set of $n+m$ samples which cannot be distinguished from $n+m$…

Statistics Theory · Mathematics 2024-09-19 Brian Axelrod , Shivam Garg , Yanjun Han , Vatsal Sharan , Gregory Valiant

Motivated by stochastic optimization, we introduce the problem of learning from samples of contextual value distributions. A contextual value distribution can be understood as a family of real-valued distributions, where each sample…

Machine Learning · Computer Science 2025-05-23 Anna Heuser , Thomas Kesselheim

In this work, we give a novel general approach for distribution testing. We describe two techniques: our first technique gives sample-optimal testers, while our second technique gives matching sample lower bounds. As a consequence, we…

Data Structures and Algorithms · Computer Science 2016-05-10 Ilias Diakonikolas , Daniel M. Kane

As statistical analyses become more central to science, industry and society, there is a growing need to ensure correctness of their results. Approximate correctness can be verified by replicating the entire analysis, but can we verify…

Computational Complexity · Computer Science 2024-09-11 Tal Herman , Guy Rothblum

We consider the problem of reconstructing an unknown function $u\in L^2(D,\mu)$ from its evaluations at given sampling points $x^1,\dots,x^m\in D$, where $D\subset \mathbb R^d$ is a general domain and $\mu$ a probability measure. The…

Numerical Analysis · Mathematics 2020-10-29 Albert Cohen , Matthieu Dolbeault

We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a seller with unlimited supply of n item types facing m myopic…

Computer Science and Game Theory · Computer Science 2010-11-02 Maria-Florina Balcan , Florin Constantin

In statistical inference, uncertainty is unknown and all models are wrong. That is to say, a person who makes a statistical model and a prior distribution is simultaneously aware that both are fictional candidates. To study such cases,…

Machine Learning · Computer Science 2023-02-13 Sumio Watanabe

We propose an unconstrained stochastic approximation method of finding the optimal measure change (in an a priori parametric family) for Monte Carlo simulations. We consider different parametric families based on the Girsanov theorem and…

Probability · Mathematics 2018-02-20 Vincent Lemaire , Gilles Pagès