Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

59118177236 · Jun 202019922001200920172026
48 results for operator norm

Online learning of linear operators between infinite-dimensional spaces is possible but with limitations.

problem Learning linear operators between infinite-dimensional Hilbert spaces in an online setting.
method Online learning approach for linear operators with bounded pp-Schatten norm, proving impossibility for operator norm.
result Separation between online learnability and uniform convergence for bounded linear operators.

Unique inhomogeneous ruled hypersurface found in complex hyperbolic space.

problem Classifying ruled real hypersurfaces with constant norm.
method Analyzing nonflat complex space forms, proving existence and uniqueness.
result Existence of a unique inhomogeneous example in complex hyperbolic space.

Applying standard techniques from Toeplitz operator theory, we analyze the asymptotics of the Hilbert-Smith norms of the TQFT operators coming from isotopy classes of one dimensional oriented submanifolds on a closed oriented surface. We thereby obtain a Toeplitz operator interpretation and generalization of the asympt…

2006-05-11abs ↗pdf ↗

Optimal scaling found to depend on operator norm across large models and datasets.

problem Lack of unifying principle for optimal hyperparameter scaling across models and datasets.
method Discovered that optimal scaling is conditioned on the operator norm of the output layer.
result The optimal learning rate/batch size pair (η,B)(η^{\ast}, B^{\ast}) consistently has the same operator norm value.

Proximal operators are of particular interest in optimization problems dealing with non-smooth objectives because in many practical cases they lead to optimization algorithms whose updates can be computed in closed form or very efficiently. A well-known example is the proximal operator of the vector 1\ell_1 norm, whic…

2019-10-09abs ↗pdf ↗

We model how Lipschitz continuity changes during neural network training.

problem Understanding how Lipschitz continuity evolves during training.
method We use a system of stochastic differential equations to capture the dynamics of Lipschitz continuity under SGD.
result We identify three factors driving the evolution of Lipschitz continuity: gradient flow projection, gradient noise, and Hessian projection.

Study of unitary and groupoid orbits of normal operators, focusing on manifold structures and spectral conditions.

problem Understanding the manifold structures of orbits of normal operators under different norm topologies.
method Unified treatment of unitary and groupoid orbits, using moment maps and conditional expectations.
result Differentiable structures for orbits and necessary spectral conditions for norm closure and submanifold properties.

A new method for learning function parameters in operators using data-adaptive RKHS.

problem Learning function parameters in operators with robustness to noise and numerical error.
method Data Adaptive RKHS Tikhonov Regularization (DARTR) method.
result DARTR leads to an accurate estimator robust to noise and numerical error, converging at a consistent rate as data refines.

Improved 2-bit covariance estimator with reduced operator norm error and no tuning needed.

problem Improving 2-bit covariance estimation with reduced operator norm error and no tuning needed.
method Proposed a new 2-bit covariance matrix estimator using triangular dithering scales.
result Improved operator norm error rate that depends on effective rank of covariance matrix, closing theoretical gap.

A toolkit for path-norms enhances neural network generalization bounds.

problem Establishing generalization bounds for modern neural networks.
method Introducing a comprehensive toolkit for path-norms in ReLU networks with various operations.
result Established generalization bounds for modern neural networks that are the most widely applicable and recover/beat the sharpest known bounds.

We propose a Generalized Dantzig Selector (GDS) for linear models, in which any norm encoding the parameter structure can be leveraged for estimation. We investigate both computational and statistical aspects of the GDS. Based on conjugate proximal operator, a flexible inexact ADMM framework is designed for solving GDS…

2014-06-20abs ↗pdf ↗

Geometrically studies Moore-Penrose inverse and polar decomposition continuity.

problem Continuity of Moore-Penrose inverse for perturbations by operator ideals.
method Geometric construction using essential codimension and Banach-Lie group action.
result Moore-Penrose inverse is a real analytic map between manifolds.

The OSCAR (octagonal selection and clustering algorithm for regression) regularizer consists of a L_1 norm plus a pair-wise L_inf norm (responsible for its grouping behavior) and was proposed to encourage group sparsity in scenarios where the groups are a priori unknown. The OSCAR regularizer has a non-trivial proximit…

2013-09-24abs ↗pdf ↗

New method for efficient proximal mapping of 1-path-norm in shallow networks.

problem Efficiently handling the 1-path-norm of shallow neural networks.
method Closed-form proximal operator for efficient computation and upper bound on Lipschitz constant.
result Proximal mapping allows robust training against adversarial perturbations.

The paper extends inequalities for convex bodies to higher dimensions and various norms.

problem Extending inequalities for convex bodies to higher dimensions and various norms.
method Developed new operators and inequalities for higher-order LpL^p norms.
result Established mmth-order LpL^p isoperimetric inequalities.

The paper extends manifold learning to arbitrary norms, improving molecular motion mapping.

problem Improving manifold learning for non-Euclidean norms.
method Determines the limiting differential operator for graph Laplacians using any norm.
result A modified Laplacian eigenmaps algorithm using Earthmover's distance outperforms Euclidean methods in molecular motion mapping.

Unified formula for higher traces of linear maps on finite-dimensional normed spaces.

problem Unified trace-average formula for higher traces of linear maps.
method Unified trace-average formula for the k-th higher trace of a linear operator A on a finite-dimensional normed space.
result Unified trace-average formula holds for all A if and only if the operator-valued average equals the identity.

New optimizers control network width scaling, improving stability and transfer across different model sizes.

problem Designing stable optimizers for networks of varying widths.
method Interpreting optimizers as steepest descent under mean-normalized operator norms, enabling layerwise composability and width-independent bounds.
result New optimizers like row normalization and column normalization provide stable learning-rate transfer across different model widths.

The kk-support norm is a regularizer which has been successfully applied to sparse vector prediction problems. We show that it belongs to a general class of norms which can be formulated as a parameterized infimum over quadratics. We further extend the kk-support norm to matrices, and we observe that it is a special …

2014-03-06abs ↗pdf ↗

Improved stochastic Halpern iteration for fixed-point approximation in normed spaces.

problem Approximating fixed-points of nonexpansive and contractive operators in normed finite-dimensional spaces.
method Stochastic Halpern iteration with minibatch, analyzing oracle complexity.
result Improved oracle complexity for nonexpansive operators, with a lower bound of Ω(ε3)Ω(\varepsilon^{-3}).

We study a regularizer which is defined as a parameterized infimum of quadratics, and which we call the box-norm. We show that the k-support norm, a regularizer proposed by [Argyriou et al, 2012] for sparse vector prediction problems, belongs to this family, and the box-norm can be generated as a perturbation of the fo…

2015-12-27abs ↗pdf ↗

The tensor-tensor product (t-product) [M. E. Kilmer and C. D. Martin, 2011] is a natural generalization of matrix multiplication. Based on t-product, many operations on matrix can be extended to tensor cases, including tensor SVD, tensor spectral norm, tensor nuclear norm [C. Lu, et al., 2018] and many others. The line…

2018-06-17abs ↗pdf ↗

Let U2(H)U_2({\cal H}) be the Banach-Lie group of unitary operators in the Hilbert space H{\cal H} which are Hilbert-Schmidt perturbations of the identity 1. In this paper we study the geometry of the unitary orbit {upu:uU2(H)},\{upu^*: u\in U_2({\cal H})\}, of an infinite projection pp in H{\cal H}. This orbit coincides with t…

2008-08-19abs ↗pdf ↗

Extends Mahalanobis distance to Banach spaces for anomaly detection.

problem Anomaly detection in infinite-dimensional spaces.
method Generalizes Mahalanobis distance to Banach spaces via Cameron-Martin norm and variance norm.
result Kernelized nearest-neighbour Mahalanobis distance outperforms traditional methods for time series novelty detection.

We study the Berezin-Toeplitz quantization on Kaehler manifolds. We explain first how to compute various associated asymptotic expansions, then we compute explicitly the first terms of the expansion of the kernel of the Berezin-Toeplitz operators, and of the composition of two Berezin-Toeplitz operators. As application…

2010-09-22abs ↗pdf ↗

Using sparse-inducing norms to learn robust models has received increasing attention from many fields for its attractive properties. Projection-based methods have been widely applied to learning tasks constrained by such norms. As a key building block of these methods, an efficient operator for Euclidean projection ont…

2012-06-18abs ↗pdf ↗

Unified analysis of MPLE for Ising models with bounded operator norm or infinity norm.

problem Estimating Ising models in Total Variation distance with limited samples.
method Maximum Pseudo-Likelihood Estimator (MPLE) for two general classes of Ising models.
result Unified framework for polynomial-time estimation in TV distance for two general classes of Ising models.

We prove an estimate for Donaldson's QQ-operator on a prequantized compact symplectic manifold. This estimate is an ingredient in the recent result of Keller and Lejmi about a symplectic generalization of Donaldson's lower bound for the L2L^2-norm of the Hermitian scalar curvature.

2017-03-15abs ↗pdf ↗

Learning rates for least-squares regression are typically expressed in terms of L2L_2-norms. In this paper we extend these rates to norms stronger than the L2L_2-norm without requiring the regression function to be contained in the hypothesis space. In the special case of Sobolev reproducing kernel Hilbert spaces used …

2017-02-23abs ↗pdf ↗

Estimates the first eigenvalue of a Schrödinger operator on minimal submanifolds.

problem Estimating the first eigenvalue of a Schrödinger operator on minimal submanifolds.
method Analyzes the Schrödinger operator L:=ΔσL:=-Δ-σ on minimal submanifolds MnM^{n} in the unit sphere Sn+m\mathbb{S}^{n+m}.
result Provides an estimate for the first eigenvalue of the Schrödinger operator.

Following Hartigan, a cluster is defined as a connected component of the t-level set of the underlying density, i.e., the set of points for which the density is greater than t. A clustering algorithm which combines a density estimate with spectral clustering techniques is proposed. Our algorithm is composed of two step…

2010-02-11abs ↗pdf ↗

The paper studies the metric and algebraic structures on section rings of projective manifolds.

problem Understanding the relationship between metric and algebraic structures on section rings.
method Analyzes the section ring of projective manifolds and ample line bundles, proving approximate isometry properties under various norms.
result Characterizes L2L^2-norms associated with continuous plurisubharmonic metrics and refines the theorem of Phong-Sturm.