English
Related papers

Related papers: The determinant bound for discrepancy is almost ti…

200 papers

In machine learning, the loss functions optimized during training often differ from the target loss that defines task performance due to computational intractability or lack of differentiability. We present an in-depth study of the target…

Machine Learning · Computer Science 2025-12-30 Yutao Zhong

Given three permutations on the integers 1 through n, consider the set system consisting of each interval in each of the three permutations. Jozsef Beck conjectured (c. 1987) that the discrepancy of this set system is O(1). We give a…

Discrete Mathematics · Computer Science 2011-04-18 Alantha Newman , Aleksandar Nikolov

Tight bounds for several symmetric divergence measures are derived in terms of the total variation distance. It is shown that each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these…

Information Theory · Computer Science 2016-11-17 Igal Sason

We provide matching upper and lower bounds of order $\sigma^2/\log(d/n)$ for the prediction error of the minimum $\ell_1$-norm interpolator, a.k.a. basis pursuit. Our result is tight up to negligible terms when $d \gg n$, and is the first…

Statistics Theory · Mathematics 2022-03-09 Guillaume Wang , Konstantin Donhauser , Fanny Yang

We extend the notion of combinatorial discrepancy to \emph{non-additive} functions. Our main result is an upper bound of $O(\sqrt{n \log(nk)})$ on the non-additive $k$-color discrepancy when $k$ is a prime power. We demonstrate two…

Computer Science and Game Theory · Computer Science 2025-09-23 Max Dupre la Tour , Kaito Fujii

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

Optimization and Control · Mathematics 2024-07-25 Boulos El Hilany , Elias Tsigaridas

A collection of families $(\mathcal{F}_{1}, \mathcal{F}_{2} , \cdots , \mathcal{F}_{k}) \in \mathcal{P}([n])^k$ is cross-Sperner if there is no pair $i \not= j$ for which some $F_i \in \mathcal{F}_i$ is comparable to some $F_j \in…

Combinatorics · Mathematics 2023-02-07 Natalie Behague , Akina Kuperus , Natasha Morrison , Ashna Wright

We prove a suite of dynamical results, including exactness of the transformation and piecewise-analyticity of the invariant measure, for a family of continued fraction systems, including specific examples over reals, complex numbers,…

Dynamical Systems · Mathematics 2023-03-07 Anton Lukyanenko , Joseph Vandehey

In 1975 Walter Philipp proved the law of the iterated logarithm (LIL) for the discrepancy of lacunary sequences: for any sequence $(n_k)_{k \geq 1}$ satisfying the Hadamard gap condition $n_{k+1} / n_k \geq q > 1,~k \geq 1,$ we have $$…

Number Theory · Mathematics 2014-07-31 Christoph Aistleitner , Katusi Fukuyama

Computable Stein discrepancies have been deployed for a variety of applications, ranging from sampler selection in posterior inference to approximate Bayesian inference to goodness-of-fit testing. Existing convergence-determining Stein…

Machine Learning · Statistics 2021-10-12 Jonathan H. Huggins , Lester Mackey

We investigate the combinatorial discrepancy of geometric set systems having bounded shallow cell complexity in the \emph{Beck-Fiala} setting, where each point belongs to at most $t$ ranges. For set systems with shallow cell complexity…

Computational Geometry · Computer Science 2023-01-10 Kunal Dutta , Arijit Ghosh

Learning of continuous exponential family distributions with unbounded support remains an important area of research for both theory and applications in high-dimensional statistics. In recent years, score matching has become a widely used…

Machine Learning · Computer Science 2026-05-15 Devin Smedira , Abhijith Jayakumar , Sidhant Misra , Marc Vuffray , Andrey Y. Lokhov

In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of $\mathcal{L}_q$ discrepancy. In 1954 Roth proved a lower bound for the $\mathcal{L}_2$ discrepancy of…

Number Theory · Mathematics 2013-08-21 Josef Dick , Friedrich Pillichshammer

The Lipschitz constant is an important quantity that arises in analysing the convergence of gradient-based optimization methods. It is generally unclear how to estimate the Lipschitz constant of a complex model. Thus, this paper studies an…

Machine Learning · Statistics 2023-02-10 Calypso Herrera , Florian Krach , Josef Teichmann

We present upper and lower bounds for the prediction error of the Lasso. For the case of random Gaussian design, we show that under mild conditions the prediction error of the Lasso is up to smaller order terms dominated by the prediction…

Statistics Theory · Mathematics 2018-04-04 Sara van de Geer

The sample frequency spectrum (SFS) of DNA sequences from a collection of individuals is a summary statistic which is commonly used for parametric inference in population genetics. Despite the popularity of SFS-based inference methods,…

Populations and Evolution · Quantitative Biology 2015-06-24 Jonathan Terhorst , Yun S. Song

The fundamental lower size limit in wavelength selecting structures is explored with the aid of the Heisenberg uncertainty principle. The analysis shows that for a given wavelength selectivity resonating structures with optical feedback…

Quantum Physics · Physics 2017-07-18 A. Driessen , H. J. W. M. Hoekstra , D. J. W. Klunder , F. S. Tan

The binary divergences that are divergences between probability measures defined on the same 2-point set have an interesting property. For the chi-squared divergence and the relative entropy, it is known that their binary divergence attain…

Information Theory · Computer Science 2021-02-09 Tomohiro Nishiyama

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

Functional Analysis · Mathematics 2024-03-05 Khazhgali Kozhasov , Josué Tonelli-Cueto

We give upper bounds for the determinant of an $n\times n$ zero-one matrix containing $kn$ ones for integral $k$. Our results improve upon a result of Ryser for $k=o(n^{1/3})$. For fixed $k\ge 3$ it was an open question whether Hadamard's…

Combinatorics · Mathematics 2019-03-04 Daniel Scheinerman