English
Related papers

Related papers: Optimal subgroup selection

200 papers

We investigate online convex optimization in changing environments, and choose the adaptive regret as the performance measure. The goal is to achieve a small regret over every interval so that the comparator is allowed to change over time.…

Machine Learning · Computer Science 2019-06-18 Lijun Zhang , Tie-Yan Liu , Zhi-Hua Zhou

Model complexity plays an essential role in its selection, namely, by choosing a model that fits the data and is also succinct. Two-part codes and the minimum description length have been successful in delivering procedures to single out…

Statistics Theory · Mathematics 2020-07-07 Bruno Mera , Paulo Mateus , Alexandra M. Carvalho

In multiple importance sampling we combine samples from a finite list of proposal distributions. When those proposal distributions are used to create control variates, it is possible (Owen and Zhou, 2000) to bound the ratio of the resulting…

Computation · Statistics 2014-11-18 Hera Y. He , Art B. Owen

Control rate regression is a diffuse approach to account for heterogeneity among studies in meta-analysis by including information about the outcome risk of patients in the control condition. Correcting for the presence of measurement error…

Methodology · Statistics 2018-03-29 Annamaria Guolo

If the assumed model does not accurately capture the underlying structure of the data, a statistical method is likely to yield sub-optimal results, and so model selection is crucial in order to conduct any statistical analysis. However, in…

Methodology · Statistics 2023-06-21 Vasilis Chasiotis , Dimitris Karlis

We consider the problem of estimating confidence intervals for the mean of a random variable, where the goal is to produce the smallest possible interval for a given number of samples. While minimax optimal algorithms are known for this…

Machine Learning · Statistics 2020-06-19 Shengjia Zhao , Christopher Yeh , Stefano Ermon

Sequential learning with feedback graphs is a natural extension of the multi-armed bandit problem where the problem is equipped with an underlying graph structure that provides additional information - playing an action reveals the losses…

Machine Learning · Computer Science 2023-06-06 Tomáš Kocák , Alexandra Carpentier

We consider a class of finite-horizon, linear-quadratic stochastic control problems, where the probability distribution governing the noise process is unknown but assumed to belong to an ambiguity set consisting of all distributions whose…

Optimization and Control · Mathematics 2026-04-21 Feras Al Taha , Eilyan Bitar

Treatment effect estimation is a fundamental problem in causal inference. We focus on designing efficient randomized controlled trials, to accurately estimate the effect of some treatment on a population of $n$ individuals. In particular,…

Machine Learning · Computer Science 2022-10-14 Raghavendra Addanki , David Arbour , Tung Mai , Cameron Musco , Anup Rao

A decision maker typically (i) incorporates training data to learn about the relative effectiveness of treatments, and (ii) chooses an implementation mechanism that implies an ``optimal'' predicted outcome distribution according to some…

Econometrics · Economics 2025-05-29 Anders Bredahl Kock , David Preinerstorfer

In this paper, we study the classic submodular maximization problem subject to a group equality constraint under both non-adaptive and adaptive settings. It has been shown that the utility function of many machine learning applications,…

Machine Learning · Computer Science 2023-08-30 Shaojie Tang , Jing Yuan

In this paper we discuss the variable selection method from \ell0-norm constrained regression, which is equivalent to the problem of finding the best subset of a fixed size. Our study focuses on two aspects, consistency and computation. We…

Methodology · Statistics 2013-03-20 Shifeng Xiong

The effort to understand network systems in increasing detail has resulted in a diversity of methods designed to extract their large-scale structure from data. Unfortunately, many of these methods yield diverging descriptions of the same…

Data Analysis, Statistics and Probability · Physics 2015-03-27 Tiago P. Peixoto

We consider the classic problem of online convex optimisation. Whereas the notion of static regret is relevant for stationary problems, the notion of switching regret is more appropriate for non-stationary problems. A switching regret is…

Machine Learning · Computer Science 2025-03-07 Stephen Pasteris , Chris Hicks , Vasilios Mavroudis , Mark Herbster

In this paper, we propose and analyze a trust-region model-based algorithm for solving unconstrained stochastic optimization problems. Our framework utilizes random models of an objective function $f(x)$, obtained from stochastic…

Optimization and Control · Mathematics 2016-09-26 Ruobing Chen , Matt Menickelly , Katya Scheinberg

We consider a basic problem at the interface of two fundamental fields: submodular optimization and online learning. In the online unconstrained submodular maximization (online USM) problem, there is a universe $[n]=\{1,2,...,n\}$ and a…

Machine Learning · Computer Science 2018-06-12 Tim Roughgarden , Joshua R. Wang

We consider a safe optimization problem with bandit feedback in which an agent sequentially chooses actions and observes responses from the environment, with the goal of maximizing an arbitrary function of the response while respecting…

Machine Learning · Computer Science 2023-05-02 Spencer Hutchinson , Berkay Turan , Mahnoosh Alizadeh

Distribution regression seeks to estimate the conditional distribution of a multivariate response given a continuous covariate. This approach offers a more complete characterization of dependence than traditional regression methods.…

Statistics Theory · Mathematics 2025-06-10 Rong Tang , Yun Yang

We study problem-dependent rates, i.e., generalization errors that scale near-optimally with the variance, the effective loss, or the gradient norms evaluated at the "best hypothesis." We introduce a principled framework dubbed "uniform…

Machine Learning · Statistics 2020-12-25 Yunbei Xu , Assaf Zeevi

We study the problems of data compression, gambling and prediction of a sequence $x^n=x_1x_2...x_n$ from an alphabet ${\cal X}$, in terms of regret and expected regret (redundancy) with respect to various smooth families of probability…

Information Theory · Computer Science 2025-07-25 Jun'ichi Takeuchi , Andrew R. Barron
‹ Prev 1 4 5 6 7 8 10 Next ›