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,742 papers · 148 categories

Trend · papers per month

51102153204 · May 202619922001200920172026
48 results for Universality principle

New index principle shows indistinguishability of certain knot crossings.

problem Identifying indistinguishable crossings in knot diagrams.
method Developed a universal index function on knot diagrams that respects Reidemeister moves and sign of crossings.
result Crossings of the same sign in a classical knot diagram cannot be distinguished by any inherent property.

New principle reduces load imbalance in LLM serving systems, saving up to 52% energy.

problem Wasted computational power due to load imbalance in LLM serving systems.
method Developed a universal load-balancing principle for barrier-synchronized systems with non-migratable state.
result Proves worst-case theoretical guarantees for imbalance reduction and energy savings.

Deep neural networks' infinite-width behavior approximated by Gaussian models.

problem Understanding the behavior of deep neural networks in the limit of infinite width.
method Using the Lindeberg exchange principle to approximate weights by Gaussian random variables.
result Quantitative bounds on the 2-Wasserstein distance between deep neural networks and Gaussian limits.

Along with fruitful applications of Deep Neural Networks (DNNs) to realistic problems, recently, some empirical studies of DNNs reported a universal phenomenon of Frequency Principle (F-Principle): a DNN tends to learn a target function from low to high frequencies during the training. The F-Principle has been very use…

2019-06-21abs ↗pdf ↗

Study geometric properties of log Calabi-Yau manifolds, focusing on Fano manifolds with smooth or two proportional components.

problem Geometric properties of log Calabi-Yau manifolds in two specific cases.
method Analysis of various geometric properties, focusing on Bochner principle, local triviality, polystability, and compactifiability of universal cover.
result The universal cover of XDX\setminus D is a Calabi-Yau manifold of infinite topological type when DD has two components.

This paper studies universal rates of ERM for binary classification under agnostic learning.

problem The challenge of achieving universal rates of ERM for binary classification under agnostic learning.
method The paper explores the agnostic universal rates of ERM for binary classification, revealing three possible rates: ene^{-n}, o(n1/2)o(n^{-1/2}), or arbitrarily slow.
result The paper provides a complete characterization of which concept classes fall into each of the three categories of agnostic universal rates.

Consider a family of portfolio strategies with the aim of achieving the asymptotic growth rate of the best one. The idea behind Cover's universal portfolio is to build a wealth-weighted average which can be viewed as a buy-and-hold portfolio of portfolios. When an optimal portfolio exists, the wealth-weighted average c…

2015-10-09abs ↗pdf ↗

New findings show Gaussian universality breaks down in high-dimensional linear factor mixtures.

problem The limitations of Gaussian universality in high-dimensional classification.
method Characterization of empirical risk minimization for classification under linear factor mixture models.
result Gaussian universality breaks down under high-dimensional linear factor mixtures.

Market sectors play a key role in the efficient flow of capital through the modern Global economy. We analyze existing sectorization heuristics, and observe that the most popular - the GICS (which informs the S&P 500), and the NAICS (published by the U.S. Government) - are not entirely quantitatively driven, but rather…

2019-05-31abs ↗pdf ↗

Constraining linear layers in neural networks to respect symmetry transformations from a group GG is a common design principle for invariant networks that has found many applications in machine learning. In this paper, we consider a fundamental question that has received little attention to date: Can these networks ap…

2019-01-27abs ↗pdf ↗

The fundamental theorem of the theory of optimal control, the Pontryagin maximum principle (PMP), is extended to the setting of almost Lie (AL) algebroids, geometrical objects generalizing Lie algebroids. This formulation of the PMP yields, in particular, a scheme comprising reductions of optimal control problems simil…

2009-05-17abs ↗pdf ↗

Volatility dynamics of wavelet - filtered stock price time series is studied. Using the universal thresholding method of wavelet filtering and a principle of minimal linear autocorrelation of noise component we find that the quantitative characteristics of volatility dynamics of denoised series are noticeably different…

2006-12-18abs ↗pdf ↗

Paper quantifies neural operators' efficiency for solving nonlinear parabolic PDEs.

problem Quantifying the efficiency of neural operators for solving nonlinear parabolic PDEs.
method Deriving approximation rates by transferring PDEs to integral equations and leveraging Picard's iteration.
result Neural operators can efficiently approximate solution operators of nonlinear PDEs without exponential complexity growth.

Universal AI seeks high-optionality states through empowerment and curiosity.

problem Understanding and optimizing AI behavior in uncertain environments.
method Unified framework combining AIXI and variational empowerment, showing how universal AI agents balance goal-directed behavior with uncertainty reduction curiosity.
result Self-AIXI asymptotically converges to AIXI performance and exhibits power-seeking behavior due to intrinsic motivations.

New criterion selects optimal number of clusters based on stability.

problem Challenges in selecting optimal number of clusters in non-parametric clustering.
method Proposes a stability-based validation criterion combining between-cluster and within-cluster stability.
result Empirically demonstrates effectiveness in selecting optimal number of clusters.

We consider the problem of identifying universal low-dimensional features from high-dimensional data for inference tasks in settings involving learning. For such problems, we introduce natural notions of universality and we show a local equivalence among them. Our analysis is naturally expressed via information geometr…

2019-11-20abs ↗pdf ↗

A central problem in analyzing networks is partitioning them into modules or communities. One of the best tools for this is the stochastic block model, which clusters vertices into blocks with statistically homogeneous pattern of links. Despite its flexibility and popularity, there has been a lack of principled statist…

2016-05-23abs ↗pdf ↗

The book explains deep learning theory and how networks learn nontrivial representations.

problem Understanding and optimizing deep neural networks.
method Developed RG flow to characterize signal propagation, solved layer-to-layer equations, and analyzed representation learning.
result Predictions of trained networks are nearly-Gaussian, with depth-to-width ratio controlling deviations.

ULFS-KDPE estimates parameters efficiently without influence functions.

problem Estimating pathwise differentiable parameters in nonparametric models.
method Kernel debiased plug-in estimator based on universal least favorable submodel.
result Semiparametric efficiency achieved without influence function derivation.

This research formalizes inductive generalization and proposes a new learning paradigm called Inductive Learning.

problem Generalization from easy to hard tasks, especially out-of-domain generalization.
method Formalizes inductive generalization, introduces Inductive Learning, and outlines steps to adapt techniques for learning model successors.
result A new learning paradigm (Inductive Learning) that emphasizes induction and universal properties of learning and computation.

Study of asymmetric rank-one tensor models with non-Gaussian noise.

problem Analyzing maximum-likelihood estimators for asymmetric rank-one tensor models.
method Spectrally separated branch analysis, resolvent methods, cumulant expansions, Efron-Stein-type variance bounds.
result Asymptotic singular value and mode-wise alignments are robust to non-Gaussian noise.

Most data is multi-dimensional. Discovering whether any subset of dimensions, or subspaces, of such data is significantly correlated is a core task in data mining. To do so, we require a measure that quantifies how correlated a subspace is. For practical use, such a measure should be universal in the sense that it capt…

2015-10-28abs ↗pdf ↗

General equilibrium equations in economics play the same role with many-body Newtonian equations in physics. Accordingly, each solution of the general equilibrium equations can be regarded as a possible microstate of the economic system. Since Arrow's Impossibility Theorem and Rawls' principle of social fairness will p…

2015-05-22abs ↗pdf ↗

Machine learning (ML) and artificial intelligence (AI) algorithms are now being used to automate the discovery of physics principles and governing equations from measurement data alone. However, positing a universal physical law from data is challenging without simultaneously proposing an accompanying discrepancy model…

2019-06-19abs ↗pdf ↗

Networked data, in which every training example involves two objects and may share some common objects with others, is used in many machine learning tasks such as learning to rank and link prediction. A challenge of learning from networked examples is that target values are not known for some pairs of objects. In this …

2017-11-12abs ↗pdf ↗

Proposes a new neural network architecture combining MLP and basis functions.

problem Function approximation and operator learning in scientific machine learning.
method Combines robust MLP inner functions with flexible basis functions outer functions.
result KKAN outperforms MLPs and KANs in function approximation and operator learning tasks.

Dimension reduction is the process of embedding high-dimensional data into a lower dimensional space to facilitate its analysis. In the Euclidean setting, one fundamental technique for dimension reduction is to apply a random linear map to the data. This dimension reduction procedure succeeds when it preserves certain …

2015-11-30abs ↗pdf ↗

Ultrasound (US) imaging is based on the time-reversal principle, in which individual channel RF measurements are back-propagated and accumulated to form an image after applying specific delays. While this time reversal is usually implemented as a delay-and-sum (DAS) beamformer, the image quality quickly degrades as the…

2019-01-07abs ↗pdf ↗

A classical theorem of Riemannian geometry, due in its original form to Cartan, states that the Taylor expansion of the metric in geodesic normal coordinates is a universal formal power series involving only the symmetrizations of the iterated covariant derivatives of the curvature tensor; this is known as the jet isom…

2015-09-28abs ↗pdf ↗

In this article we shall give an account of certain developments in knot theory which followed upon the discovery of the Jones polynomial in 1984. The focus of our account will be recent glimmerings of understanding of the topological meaning of the new invariants. A second theme will be the central role that braid the…

1993-04-01abs ↗pdf ↗

Unified analytical tool for non-Markovian jump processes.

problem Analyzing history-dependent jump processes with non-Markovian behavior.
method Developed a standard form of master equations using Laplace-space embedding and asymptotic solution.
result Unified analytical toolset for general non-Markovian processes, leading to the GLE approximation.