English
Related papers

Related papers: On the Approximation of Toeplitz Operators for Non…

200 papers

We study unconstrained optimization problems of nonsmooth, nonconvex Lipschitz functions, using only noisy pairwise comparisons governed by a known link function. Our goal is to compute a $(\delta,\varepsilon)$-Goldstein stationary point.…

Optimization and Control · Mathematics 2026-02-10 Taha El Bakkali , El Mahdi Chayti , Omar Saadi

In this short article we propose a full large $N$ asymptotic expansion of the probability that the $m^{\text{th}}$ power of a random unitary matrix of size $N$ has all its eigenvalues in a given arc-interval centered in $1$ when $N$ is…

Probability · Mathematics 2023-07-26 Olivier Marchal

With regard to a three-step estimation procedure, proposed without theoretical discussion by Li and You in Journal of Applied Statistics and Management, for a nonparametric regression model with time-varying regression function, local…

Statistics Theory · Mathematics 2020-10-27 Jiyanglin Li , Tao Li

Regularization methods have been recently developed to construct stable approximate solutions to classical partial differential equations considered as final value problems. In this paper, we investigate the backward parabolic problem with…

Analysis of PDEs · Mathematics 2015-10-19 Vo Anh Khoa

The feedback particle filter (FPF) is a promising nonlinear filtering (NLF) method, but its practical implementation is hindered by the intractability of the gain function, which satisfies a boundary value problem (BVP). This paper proposes…

Numerical Analysis · Mathematics 2026-04-06 Ruoyu Wang , Peng Sun , Xue Luo

We give a nearly linear time randomized approximation scheme for the Held-Karp bound [Held and Karp, 1970] for metric TSP. Formally, given an undirected edge-weighted graph $G$ on $m$ edges and $\epsilon > 0$, the algorithm outputs in $O(m…

Data Structures and Algorithms · Computer Science 2017-10-16 Chandra Chekuri , Kent Quanrud

An estimation problem of fundamental interest is that of phase synchronization, in which the goal is to recover a collection of phases using noisy measurements of relative phases. It is known that in the Gaussian noise setting, the maximum…

Optimization and Control · Mathematics 2016-11-02 Huikang Liu , Man-Chung Yue , Anthony Man-Cho So

Many real world problems exhibit patterns that have periodic behavior. For example, in astrophysics, periodic variable stars play a pivotal role in understanding our universe. An important step when analyzing data from such processes is the…

Machine Learning · Computer Science 2012-08-20 Yuyang Wang , Roni Khardon , Pavlos Protopapas

We develop an estimator-based stochastic fixed-point framework for approximately computing the 2-Wasserstein barycenter of continuous, non-parametric probability measures. Notably, we provide the first rigorous convergence analysis for…

Optimization and Control · Mathematics 2026-04-17 Zeyi Chen , Ariel Neufeld , Qikun Xiang

The problem of efficient approximation of a linear operator induced by the Gaussian or softmax kernel is often addressed using random features (RFs) which yield an unbiased approximation of the operator's result. Such operators emerge in…

Machine Learning · Computer Science 2023-02-03 Valerii Likhosherstov , Krzysztof Choromanski , Avinava Dubey , Frederick Liu , Tamas Sarlos , Adrian Weller

We propose a new first-order method for minimizing nonconvex functions with Lipschitz continuous gradients and H\"older continuous Hessians. The proposed algorithm is a heavy-ball method equipped with two particular restart mechanisms. It…

Optimization and Control · Mathematics 2026-01-05 Naoki Marumo , Akiko Takeda

An \emph{$\alpha$-approximate vertex fault-tolerant distance sensitivity oracle} (\emph{$\alpha$-VSDO}) for a weighted input graph $G=(V, E, w)$ and a source vertex $s \in V$ is the data structure answering an $\alpha$-approximate distance…

Data Structures and Algorithms · Computer Science 2024-07-03 Kaito Harada , Naoki Kitamura , Taisuke Izumi , Toshimitsu Masuzawa

We provide improved convergence rates for various \emph{non-smooth} optimization problems via higher-order accelerated methods. In the case of $\ell_\infty$ regression, we achieves an $O(\epsilon^{-4/5})$ iteration complexity, breaking the…

Optimization and Control · Mathematics 2019-06-05 Brian Bullins , Richard Peng

We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case. We analyze the associated random observation operator, and prove that with…

Information Theory · Computer Science 2011-05-17 Sahand Negahban , Martin J. Wainwright

We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…

Probability · Mathematics 2018-12-17 Anirban Basak , Elliot Paquette , Ofer Zeitouni

We consider a general linear parabolic problem with extended time boundary conditions (including initial value problems and periodic ones), and approximate it by the implicit Euler scheme in time and the Gradient Discretisation method in…

Numerical Analysis · Mathematics 2023-08-22 J Droniou , R Eymard , T Gallouët , C Guichard , R Herbin

Although persistent excitation is often acknowledged as a sufficient condition to exponentially converge in the field of adaptive parameter estimation, it must be noted that in practical applications this may be unguaranteed. Recently, more…

Systems and Control · Electrical Eng. & Systems 2024-03-19 Siyu Chen , Jing Na , Yingbo Huang

For bounded linear operators $A,B$ on a Hilbert space $\mathcal{H}$ we show the validity of the estimate $$ \sum_{\lambda \in \sigma_d (B)} \dist(\lambda, \overline{\num}(A))^p \leq \| B-A \|_{\mathcal{S}_p}^p$$ and apply it to recover and…

Spectral Theory · Mathematics 2011-09-20 Marcel Hansmann

The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification, subject to certain constraints on the assignment. The problem is NP-hard even when restricted to…

Data Structures and Algorithms · Computer Science 2015-08-28 Gregory Gutin , Magnus Wahlstrom

We consider the problem of randomly choosing the sensors of a linear time-invariant dynamical system subject to process and measurement noise. We sample the sensors independently and from the same distribution. We measure the performance of…

Systems and Control · Electrical Eng. & Systems 2021-03-23 Christopher I. Calle , Shaunak D. Bopardikar