English
Related papers

Related papers: Sparse equidistribution problems, period bounds, a…

200 papers

Sparse additive modeling is a class of effective methods for performing high-dimensional nonparametric regression. In this work we show how shape constraints such as convexity/concavity and their extensions, can be integrated into additive…

Machine Learning · Computer Science 2017-05-03 Junming Yin , Yaoliang Yu

We shall introduce and study certain truncated sums of Hecke eigenvalues of $GL_2$-automorphic forms along quadratic polynomials. A power saving estimate is established and new applications to moments of critical $L$-values associated to…

Number Theory · Mathematics 2019-12-19 Nicolas Templier

We present a systematic approach to the optimal placement of finitely many sensors in order to infer a finite-dimensional parameter from point evaluations of the solution of an associated parameter-dependent elliptic PDE. The quality of the…

Optimization and Control · Mathematics 2021-03-30 Ira Neitzel , Konstantin Pieper , Boris Vexler , Daniel Walter

We propose a novel method for establishing the sparsity of the coefficients of the Laguerre generalized polynomial chaos expansion of solutions to parametric elliptic PDEs with log-gamma inputs on $\mathbb{R}_+^\infty$. The established…

Numerical Analysis · Mathematics 2026-03-17 Dinh Dũng , Van Kien Nguyen , Viet Ha Hoang

We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…

Statistical Mechanics · Physics 2009-11-10 Bo Söderberg

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…

Computational Geometry · Computer Science 2018-03-06 Samy Ait-Aoudia , Adel Moussaoui , Khaled Abid , Dominique Michelucci

We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…

Optimization and Control · Mathematics 2010-09-21 Dan Butnariu , Yair Censor , Pini Gurfil , Ethan Hadar

Theoretical expressions for the distribution of the ratio of consecutive level spacings for quantum systems with transiting dynamics remain unknown. We propose a family of one-parameter distributions $P(r)\equiv P(r;\beta)$, where…

Quantum Physics · Physics 2020-03-03 A. L. Corps , A. Relaño

Existing methods of vector autoregressive model for multivariate time series analysis make use of low-rank matrix approximation or Tucker decomposition to reduce the dimension of the over-parameterization issue. In this paper, we propose a…

Statistics Theory · Mathematics 2026-01-05 Sijia Xia , Michael K. Ng , Xiongjun Zhang

We investigate the error of the (semidiscrete) Galerkin method applied to a semilinear subdiffusion equation in the presence of a nonsmooth initial data. The diffusion coefficient is allowed to depend on time. It is well-known that in such…

Numerical Analysis · Mathematics 2022-03-01 Łukasz Płociniczak

In this paper, we study the homogenization of the third boundary value problem for semilinear parabolic PDEs with rapidly oscillating periodic coefficients in the weak sense. Our method is entirely probabilistic, and builds upon the work of…

Probability · Mathematics 2024-06-25 Junxia Duan , Jun Peng

We describe a short, reproducible workflow for applying finite differences on nonuniform grids determined by a positive weight function g. The grid is obtained by equidistribution, mapping uniform computational coordinates $\xi\in[0,1]$ to…

Numerical Analysis · Mathematics 2025-08-06 Mário B. Amaro

Sparse generalized eigenvalue problem (GEP) plays a pivotal role in a large family of high-dimensional statistical models, including sparse Fisher's discriminant analysis, canonical correlation analysis, and sufficient dimension reduction.…

Machine Learning · Statistics 2018-09-05 Kean Ming Tan , Zhaoran Wang , Han Liu , Tong Zhang

We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objective functions through local computations and communications. For this…

Optimization and Control · Mathematics 2008-03-11 Angelia Nedić , Alex Olshevsky , Asuman Ozdaglar , John N. Tsitsiklis

The celebrated Birkhoff Ergodic Theorem asserts that, for an ergodic map, orbits of almost every point equidistributes when sampled at integer times. This result was generalized by Bourgain to many natural sparse subsets of the integers. On…

Dynamical Systems · Mathematics 2025-09-26 Max Auer

GMRES is a popular Krylov subspace method for solving linear systems of equations involving a general non-Hermitian coefficient matrix. The conventional bounds on GMRES convergence involve polynomial approximation problems in the complex…

Numerical Analysis · Mathematics 2022-09-07 Mark Embree

The study of parameter-dependent partial differential equations (parametric PDEs) with countably many parameters has been actively studied for the last few decades. In particular, it has been well known that a certain type of parametric…

Numerical Analysis · Mathematics 2025-02-10 Byeong-Ho Bahn

We examine the interplay of symmetry and topological order in $2+1$ dimensional topological phases of matter. We present a definition of the \it topological symmetry \rm group, which characterizes the symmetry of the emergent topological…

Strongly Correlated Electrons · Physics 2019-10-16 Maissam Barkeshli , Parsa Bonderson , Meng Cheng , Zhenghan Wang

Using methods of p-adic analysis we give a different proof of Burnside's problem for automorphisms of quasiprojective varieties X defined over a field of characteristic 0. More precisely, we show that any finitely generated torsion subgroup…

Number Theory · Mathematics 2013-11-12 Jason P. Bell , Dragos Ghioca , Thomas J. Tucker

Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the $\ell_1$-norm. However, several important learning applications cannot benefit from this approach as…

Machine Learning · Computer Science 2013-04-11 Anastasios Kyrillidis , Stephen Becker , Volkan Cevher and , Christoph Koch