English
Related papers

Related papers: The Trace Problem for Toeplitz Matrices and Operat…

200 papers

Stationary reciprocal processes defined on a finite interval of the integer line can be seen as a special class of Markov random fields restricted to one dimension. Non stationary reciprocal processes have been extensively studied in the…

Optimization and Control · Mathematics 2016-11-17 Francesca Carli , Augusto Ferrante , Michele Pavon , Giorgio Picci

As supported by abundant experimental evidence, neural networks are state-of-the-art for many approximation tasks in high-dimensional spaces. Still, there is a lack of a rigorous theoretical understanding of what they can approximate, at…

Numerical Analysis · Mathematics 2024-06-24 Elena Celledoni , James Jackaman , Davide Murari , Brynjulf Owren

We study the problem of approximating orthogonal matrices so that their application is numerically fast and yet accurate. We find an approximation by solving an optimization problem over a set of structured matrices, that we call extended…

Numerical Analysis · Mathematics 2021-03-24 Cristian Rusu , Lorenzo Rosasco

This paper tackles the problem of Lipschitz regularization of Convolutional Neural Networks. Lipschitz regularity is now established as a key property of modern deep learning with implications in training stability, generalization,…

Machine Learning · Computer Science 2020-11-10 Alexandre Araujo , Benjamin Negrevergne , Yann Chevaleyre , Jamal Atif

Recurrent neural networks are used to forecast time series in finance, climate, language, and from many other domains. Reservoir computers are a particularly easily trainable form of recurrent neural network. Recently, a "next-generation"…

Machine Learning · Computer Science 2023-03-28 Sarah E. Marzen , Paul M. Riechers , James P. Crutchfield

We survey current developments in the approximation theory of sequence modelling in machine learning. Particular emphasis is placed on classifying existing results for various model architectures through the lens of classical approximation…

Machine Learning · Computer Science 2023-02-28 Haotian Jiang , Qianxiao Li , Zhong Li , Shida Wang

For truncated Toeplitz operators, which are compressions of multiplication operators to model subspaces of the Hardy space $H^2$, we obtain criteria for commutation relations. The results show an analogy to the case of Toeplitz matrices,…

Functional Analysis · Mathematics 2013-05-30 Isabelle Chalendar , Dan Timotin

Delay differential equations are of great importance in science, engineering, medicine and biological models. These type of models include time delay phenomena which is helpful for characterising the real-world applications in machine…

Numerical Analysis · Mathematics 2021-03-17 Burcu Gürbüz

Truncated Toeplitz operators are compressions of multiplication operators on $L^2$ to model spaces (that is, subspaces of $H^2$ which are invariant with respect to the backward shift). For this class of operators we prove certain Szeg\"o…

Functional Analysis · Mathematics 2017-02-28 Elizabeth Strouse , Dan Timotin , Mohamed Zarrabi

A powerful tool for analyzing and approximating the singular values and eigenvalues of structured matrices is the theory of GLT sequences. By the GLT theory one can derive a function, which describes the singular value or the eigenvalue…

Numerical Analysis · Mathematics 2022-06-28 Matthias Bolten , Sven-Erik Ekström , Isabella Furci , Stefano Serra-Capizzano

We recall four open problems concerning constructing high-order matrix-exponential approximations for the infimum of a spectrally negative Levy process (with applications to first-passage/ruin probabilities, the waiting time distribution in…

Probability · Mathematics 2012-10-10 Florin Avram , Andras Horvath , M. R. Pistorius

Solving the Toeplitz systems, which is to find the vector $x$ such that $T_nx = b$ given an $n\times n$ Toeplitz matrix $T_n$ and a vector $b$, has a variety of applications in mathematics and engineering. In this paper, we present a…

Quantum Physics · Physics 2018-06-20 Lin-Chun Wan , Chao-Hua Yu , Shi-Jie Pan , Fei Gao , Qiao-Yan Wen , Su-Juan Qin

We present a sublinear time algorithm for computing a near optimal low-rank approximation to any positive semidefinite (PSD) Toeplitz matrix $T\in \mathbb{R}^{d\times d}$, given noisy access to its entries. In particular, given entrywise…

Data Structures and Algorithms · Computer Science 2024-04-23 Cameron Musco , Kshiteej Sheth

We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time…

Computational Complexity · Computer Science 2017-06-08 Benoit Darties , Rodolphe Giroudeau , Jean-Claude König , Gilles Simonin

We analyse the convergence of the proximal gradient algorithm for convex composite problems in the presence of gradient and proximal computational inaccuracies. We derive new tighter deterministic and probabilistic bounds that we use to…

Optimization and Control · Mathematics 2022-03-07 Anis Hamadouche , Yun Wu , Andrew M. Wallace , Joao F. C. Mota

Compressed sensing seeks to recover a sparse vector from a small number of linear and non-adaptive measurements. While most work so far focuses on Gaussian or Bernoulli random measurements we investigate the use of partial random circulant…

Information Theory · Computer Science 2009-02-26 Holger Rauhut

This paper is a survey on the emerging theory of truncated Toeplitz operators. We begin with a brief introduction to the subject and then highlight the many recent developments in the field since Sarason's seminal paper in 2007.

Complex Variables · Mathematics 2012-06-25 Stephan Ramon Garcia , William T. Ross

We consider the class of positive bounded and semi-continuous functions defined on the two dimensional torus If f belongs to this class, then f will be considered as the symbol of a Toeplitz operator truncated on a triangle parametrised by…

Functional Analysis · Mathematics 2013-02-26 Jean-Marc Rinkel , Abdellatif Seghier

We consider a stationary process (with either discrete or continuous time) and find an adaptive approximating stationary process combining approximation quality and supplementary good properties that can be interpreted as additional…

Probability · Mathematics 2020-02-19 Zakhar Kabluchko , Mikhail Lifshits

Partially observable environments present a considerable computational challenge in reinforcement learning due to the need to consider long histories. Learning with a finite window of observations quickly becomes intractable as the window…

Machine Learning · Computer Science 2025-06-04 Onno Eberhard , Michael Muehlebach , Claire Vernade
‹ Prev 1 4 5 6 7 8 10 Next ›