English
Related papers

Related papers: The Pareto Record Frontier

200 papers

Let $d\ge3$ and $\mathbb{F}_q^{\,d}$ be the $d$-dimensional vector space over a finite field of order $q$, where $q$ is an odd prime power. Let $X_\pi$ be the set of lines through the origin intersecting the slice $\pi\cap S^{d-1}$, where…

Combinatorics · Mathematics 2025-12-12 Le Quang Ham , Do Trong Hoang , Le Quang Hung , Doowon Koh , Thang Pham

Machine learning applications frequently come with multiple diverse objectives and constraints that can change over time. Accordingly, trained models can be tuned with sets of hyper-parameters that affect their predictive behavior (e.g.,…

Machine Learning · Computer Science 2022-10-17 Bracha Laufer-Goldshtein , Adam Fisch , Regina Barzilay , Tommi Jaakkola

Let $W_i=\{W_i(t_i), t_i\in \R_+\}, i=1,2,\ldots,d$ are independent Wiener processes. $W=\{W(\mathbf{t}),t\in \R_+^d\}$ be the additive Wiener field define as the sum of $W_i$. For any trend $f$ in $\kHC$ (the reproducing kernel Hilbert…

Probability · Mathematics 2016-10-25 Pingjin Deng

We bound the number of electromagnetic signals which may be observed over a frequency range $[F-W,F+W]$ a time interval $[0,T]$ within a sphere of radius $R$. We show that the such constrained signals may be represented by a series…

Information Theory · Computer Science 2007-07-13 Leif Hanlen Thushara Abhayapala

The critical behaviour of correlation functions near a boundary is modified from that in the bulk. When the boundary is smooth this is known to be characterised by the surface scaling dimension $\xt$. We consider the case when the boundary…

Statistical Mechanics · Physics 2009-10-31 John Cardy

Given a line segment $I=[0,L]$, the so-called barrier, and a set of $n$ sensors with varying ranges positioned on the line containing $I$, the barrier coverage problem is to move the sensors so that they cover $I$, while minimising the…

Data Structures and Algorithms · Computer Science 2017-10-02 Serge Gaspers , Joachim Gudmundsson , Julián Mestre , Stefan Rümmele

We consider the point process \begin{align*} \frac{1}{Z_{n}}\prod_{1 \leq j < k \leq n} |e^{i\theta_{j}}-e^{-i\theta_{k}}|^{\beta}\prod_{j=1}^{n} d\theta_{j}, \qquad \theta_{1},\ldots,\theta_{n} \in (-\pi,\pi], \quad \beta > 0, \end{align*}…

Probability · Mathematics 2026-04-08 Christophe Charlier

We study local asymptotics for the spectral projector associated to a Schr\"odinger operator $-\hbar^2\Delta+V$ on $\mathbb{R}^n$ in the semiclassical limit as $\hbar\to0$. We prove local uniform convergence of the rescaled integral kernel…

Mathematical Physics · Physics 2024-03-25 Alix Deleporte , Gaultier Lambert

We construct extensions of the pure-jump $\Lambda$-Wright-Fisher processes with frequency-dependent selection ($\Lambda$-WF processes with selection) beyond their first passage time at the boundary $1$. We show that they satisfy some…

Probability · Mathematics 2020-12-17 Clément Foucart , Xiaowen Zhou

We prove convergence results for variants of Smirnov's fermionic observable in the critical Ising model in presence of free boundary conditions. One application of our analysis is a simple proof of a theorem by Hongler and Kyt\"ol\"a on…

Mathematical Physics · Physics 2015-06-19 Konstantin Izyurov

We present a unified, SI-consistent framework to constrain minimal SME coefficients $a_\mu$ and $b_\mu$ using magnetically confined two-dimensional electron systems under a uniform magnetic field. Working in the nonrelativistic…

Mesoscale and Nanoscale Physics · Physics 2025-10-29 Edilberto O. Silva

We establish an $L_1$-bound between the coefficients of the optimal causal filter applied to the data-generating process and its finite sample approximation. Here, we assume that the data-generating process is a second-order stationary time…

Statistics Theory · Mathematics 2023-12-12 Junho Yang

We develop a new analysis of sampling-based motion planning in Euclidean space with uniform random sampling, which significantly improves upon the celebrated result of Karaman and Frazzoli (2011) and subsequent work. Particularly, we prove…

Robotics · Computer Science 2018-12-27 Kiril Solovey , Michal Kleinbort

In this article, we consider a stationary array $(X_{j,n})_{1 \leq j \leq n, n \geq 1}$ of random variables with values in $\bR \verb2\2 \{0\}$ (which satisfy some asymptotic dependence conditions), and the corresponding sequence…

Probability · Mathematics 2009-12-09 Raluca Balan , Sana Louhichi

We study the $c$-approximate near neighbor problem under the continuous Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the curves into a…

Computational Geometry · Computer Science 2021-11-05 Karl Bringmann , Anne Driemel , André Nusser , Ioannis Psarros

We continue our investigation of the fractal uncertainty principle (FUP) for random fractal sets. In the prequel (arXiv:2107.08276), we considered the Cantor sets in the discrete setting with alphabets randomly chosen from a base of digits…

Classical Analysis and ODEs · Mathematics 2026-04-15 Xiaolong Han , Pouria Salekani

It was shown by Burchard and Fortier that the expected $L^1$ distance between $f^*$ and $n$ random polarizations of an essentially bounded function $f$ with support in a ball of radius $L$ is bounded by $2dm(B_{2L})||f||_{\infty}n^{-1}$.…

Functional Analysis · Mathematics 2024-01-23 Marc Fortier

In modern deep learning, algorithmic choices (such as width, depth, and learning rate) are known to modulate nuanced resource tradeoffs. This work investigates how these complexities necessarily arise for feature learning in the presence of…

Machine Learning · Computer Science 2023-10-31 Benjamin L. Edelman , Surbhi Goel , Sham Kakade , Eran Malach , Cyril Zhang

Let $(X_i)_{i\geq 1}$ be a stationary mean-zero Gaussian process with covariances $\rho(k)=\PE(X_{1}X_{k+1})$ satisfying: $\rho(0)=1$ and $\rho(k)=k^{-D} L(k)$ where $D$ is in $(0,1)$ and $L$ is slowly varying at infinity. Consider the…

Statistics Theory · Mathematics 2010-12-08 Céline Lévy-Leduc , Hélène Boistard , Eric Moulines , Murad S. Taqqu , Valderio A. Reisen

We consider the noise complexity of differentially private mechanisms in the setting where the user asks $d$ linear queries $f\colon\Rn\to\Re$ non-adaptively. Here, the database is represented by a vector in $\Rn$ and proximity between…

Computational Complexity · Computer Science 2009-11-09 Moritz Hardt , Kunal Talwar