English
Related papers

Related papers: On Log-Concave-Tailed Chaoses and the Restricted I…

200 papers

These notes were written for the mini-course "Extrema of log-correlated random variables: Principles and Examples" at the Introductory School held in January 2015 at the Centre International de Rencontres Math\'ematiques in Marseille. There…

Probability · Mathematics 2016-01-05 Louis-Pierre Arguin

In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…

Probability · Mathematics 2022-10-24 Arturo Jaramillo , James Melbourne

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

Optimization and Control · Mathematics 2021-12-06 Ankit Garg , Robin Kothari , Praneeth Netrapalli , Suhail Sherif

We consider non-convex stochastic optimization using first-order algorithms for which the gradient estimates may have heavy tails. We show that a combination of gradient clipping, momentum, and normalized gradient descent yields convergence…

Machine Learning · Computer Science 2021-11-10 Ashok Cutkosky , Harsh Mehta

We show that given a log-concave offspring distribution, the corresponding sequence of Bienaym\'e-Galton-Watson trees conditioned to have $n\geq 1$ vertices admits a realization as a Markov process $(T_n)_{n\geq1}$ which adds a new…

Probability · Mathematics 2025-10-07 William Fleurat

Sufficient conditions are developed, under which the compound Poisson distribution has maximal entropy within a natural class of probability measures on the nonnegative integers. Recently, one of the authors [O. Johnson, {\em Stoch. Proc.…

Combinatorics · Mathematics 2013-03-20 Oliver Johnson , Ioannis Kontoyiannis , Mokshay Madiman

We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…

Data Structures and Algorithms · Computer Science 2025-09-29 Aditya Bhaskara , Eric Evert , Vaidehi Srinivas , Aravindan Vijayaraghavan

We study asymptotic properties of the following Markov system of $N \geq 3$ points in~$[0,1]$. At each time step, the point farthest from the current centre of mass, multiplied by a constant $p>0$, is removed and replaced by an independent…

Probability · Mathematics 2019-11-20 Philip Kennerberg , Stanislav Volkov

The first step to study lower bounds for a stochastic process is to prove a special property - Sudakov minoration. The property means that if a certain number of points from the index set are well separated then we can provide an optimal…

Probability · Mathematics 2022-09-20 Witold Bednorz

In this paper we introduce and study the Maximum-Average Subtensor ($p$-MAS) problem, in which one wants to find a subtensor of size $k$ of a given random tensor of size $N$, both of order $p$, with maximum sum of entries. We are motivated…

Disordered Systems and Neural Networks · Physics 2026-03-11 Vittorio Erba , Nathan Malo Kupferschmid , Rodrigo Pérez Ortiz , Lenka Zdeborová

The probability distribution of sums of iterates of the logistic map at the edge of chaos has been recently shown [see U. Tirnakli, C. Beck and C. Tsallis, Phys. Rev. E 75, 040106(R) (2007)] to be numerically consistent with a q-Gaussian,…

Statistical Mechanics · Physics 2015-05-13 Ugur Tirnakli , Constantino Tsallis , Christian Beck

We obtain optimal moment bounds for Birkhoff sums, and optimal concentration inequalities, for a large class of slowly mixing dynamical systems, including those that admit anomalous diffusion in the form of a stable law or a central limit…

Dynamical Systems · Mathematics 2017-09-01 Sébastien Gouëzel , Ian Melbourne

We consider a mechanism for area preserving Hamiltonian systems which leads to the enhanced probability, $P(\lambda, t)$, to find small values of the finite time Lyapunov exponent, $\lambda$. In our investigation of chaotic dynamical…

Chaotic Dynamics · Physics 2007-05-23 P. G. Silvestrov , I. V. Ponomarev

Random matrices acting on structured sets play a fundamental role in high-dimensional geometry, compressed sensing, and randomized algorithms. Existing results primarily focus on subgaussian models, when random matrices act as…

Probability · Mathematics 2026-03-11 Tiankun Diao , Xuanang Hu , Vladimir V. Ulyanov , Hanchao Wang

We numerically investigate the characteristics of chaos evolution during wave packet spreading in two typical one-dimensional nonlinear disordered lattices: the Klein-Gordon system and the discrete nonlinear Schr\"{o}dinger equation model.…

Chaotic Dynamics · Physics 2018-12-05 B. Senyange , B. Many Manda , Ch. Skokos

We study fundamental limits of first-order stochastic optimization in a range of nonconvex settings, including L-smooth functions satisfying Quasar-Convexity (QC), Quadratic Growth (QG), and Restricted Secant Inequalities (RSI). While the…

Machine Learning · Statistics 2025-06-03 El Mehdi Saad , Wei-Cheng Lee , Francesco Orabona

The stochastic linear--quadratic regulator problem subject to Gaussian disturbances is well known and usually addressed via a moment-based reformulation. Here, we leverage polynomial chaos expansions, which model random variables via series…

Optimization and Control · Mathematics 2025-02-14 Ruchuan Ou , Jonas Schießl , Michael Heinrich Baumann , Lars Grüne , Timm Faulwasser

In optimal control, extending the class of admissible controls is a common strategy to guarantee the existence of optimal solutions. However, such extensions may introduce a gap between the infimum of the original problem and the minimum of…

Optimization and Control · Mathematics 2026-03-09 Monica Motta , Michele Palladino , Franco Rampazzo

Let $A$ be an $N \times N$ Fourier matrix over $\mathbb{F}_p^{\log{N}/\log{p}}$ for some prime $p$. We improve upon known lower bounds for the number of rows of $A$ that must be sampled so that the resulting matrix $M$ satisfies the…

Information Theory · Computer Science 2019-03-29 Shravas Rao

A matrix $A \in \mathbb{C}^{q \times N}$ satisfies the restricted isometry property of order $k$ with constant $\varepsilon$ if it preserves the $\ell_2$ norm of all $k$-sparse vectors up to a factor of $1\pm \varepsilon$. We prove that a…

Data Structures and Algorithms · Computer Science 2015-10-14 Ishay Haviv , Oded Regev
‹ Prev 1 3 4 5 6 7 10 Next ›