paper-with-me

Papers

A refinement of Bennett's inequality with applications to portfolio optimization

2018-04-16 · Tony Jebara

A refinement of Bennett's inequality is introduced which is strictly tighter than the classical bound. The new bound establishes the convergence of the average of independent random variables to its expected value. It also carefully exploits information about the potentially heterogeneous mean, variance, and ceiling of each random variable. The bound is strictly sharper in the homogeneous setting and very often significantly sharper in the heterogeneous setting. The improved convergence rates are obtained by leveraging Lambert's W function. We apply the new bound in a portfolio optimization setting to allocate a budget across investments with heterogeneous returns.

📄 PDF Abstract BibTeX arXiv:1804.05454

Code (0)

등록된 구현이 없습니다.

Tasks

Portfolio Optimization

Similar Papers 제목 키워드 기반

Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote

2021-06-25 · NeurIPS 2021 12 · Yi-Shan Wu, Andrés R. Masegosa, Stephan S. Lorenzen, Christian Igel 외

We present a new second-order oracle bound for the expected risk of a weighted majority vote. The bound is based on a novel parametric form of the Chebyshev- Cantelli inequality (a.k.a. one-sided Chebyshev's), which is a…

Form

Sharper Risk Bound for Multi-Task Learning with Multi-Graph Dependent Data

2025-02-25 · Xiao Shao, Guoqiang Wu

In multi-task learning (MTL) with each task involving graph-dependent data, existing generalization analyses yield a \emph{sub-optimal} risk bound of $O(\frac{1}{\sqrt{n}})$, where $n$ is the number of training samples o…

Multi-Task Learning

Bennett-type Generalization Bounds: Large-deviation Case and Faster Rate of Convergence

2013-09-26 · Chao Zhang

In this paper, we present the Bennett-type generalization bounds of the learning process for i.i.d. samples, and then show that the generalization bounds have a faster rate of convergence than the traditional results. In…

Generalization Bounds

A Bennett Inequality for the Missing Mass

2015-03-20 · Bahman Yari Saeed Khanloo

Novel concentration inequalities are obtained for the missing mass, i.e. the total probability mass of the outcomes not observed in the sample. We derive distribution-free deviation bounds with sublinear exponents in dev…

Learning Theory

Split-kl and PAC-Bayes-split-kl Inequalities for Ternary Random Variables

2022-06-01 · Yi-Shan Wu, Yevgeny Seldin

We present a new concentration of measure inequality for sums of independent bounded random variables, which we name a split-kl inequality. The inequality is particularly well-suited for ternary random variables, which n…

Open-Ended Question Answering