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

165330495660 · Jun 202019922001200920172026
48 results for theoretical properties

Theoretical model for iterative user discovery in recommender systems.

problem Iterative feedback loops in recommender systems and their biases.
method Theoretical framework to model system evolution and convergence properties.
result Theoretical bounds and convergence properties on user discovery and blind spots.

We propose a new class of transforms that we call {\it Lehmer Transform} which is motivated by the {\it Lehmer mean function}. The proposed {\it Lehmer transform} decomposes a function of a sample into their constituting statistical moments. Theoretical properties of the proposed transform are presented. This transform…

2018-05-13abs ↗pdf ↗

We discuss the finite sample theoretical properties of online predictions in non-stationary time series under model misspecification. To analyze the theoretical predictive properties of statistical methods under this setting, we first define the Kullback-Leibler risk, in order to place the problem within a decision the…

2019-11-20abs ↗pdf ↗

Theoretical study of random forests for nonlinear time series.

problem Theoretical justification for using random forests in time series modeling.
method Uniform concentration inequality for regression trees and random forests consistency proof.
result Consistency of random forests for nonlinear autoregressive processes.

Variational inference is a popular technique to approximate a possibly intractable Bayesian posterior with a more tractable one. Recently, boosting variational inference has been proposed as a new paradigm to approximate the posterior by a mixture of densities by greedily adding components to the mixture. However, as i…

2017-08-05abs ↗pdf ↗

In this paper we develop some group theoretical methods which are shown to be very useful for a better understanding of the properties of the Riccati equation and we discuss some of its integrability conditions from a group theoretical perspective. The nonlinear superposition principle also arises in a simple way.

1998-10-07abs ↗pdf ↗

This work explores the generalization properties of diffusion models, providing theoretical and empirical insights.

problem Theoretical understanding of diffusion models' generalization capabilities remains underdeveloped.
method Theoretical exploration and quantitative analysis of generalization gaps in diffusion models.
result Established polynomially small generalization error (O(n2/5+m4/5)O(n^{-2/5}+m^{-4/5})) for diffusion models, avoiding the curse of dimensionality.

Empirical study shows consistent meta-RL algorithms adapt to OOD tasks.

problem Theoretical consistency of meta-RL algorithms and its practical implications.
method Empirical investigation of representative meta-RL algorithms, focusing on consistency and adaptation to out-of-distribution tasks.
result Theoretical consistent algorithms can adapt to OOD tasks, while inconsistent ones cannot, but can still fail for poor exploration.

The paper studies properties of group relations induced by compatible coarse structures.

problem Properties of asymptotic resemblance relations on groups.
method Generalization of asymptotic dimension and introduction of set theoretic coupling.
result Groups with compatible coarse structures that admit a set theoretic coupling are asymptotic equivalent.

Study examines Lasso performance in high-dimensional MoE models.

problem Estimating MoE models in high-dimensional settings with Lasso.
method Investigates SGMoE models with Lasso regularization under mild assumptions.
result Provides non-asymptotic bounds for Lasso regularization parameter.

This paper explores the information-theoretic limitations of graph property testing in zero-field Ising models. Instead of learning the entire graph structure, sometimes testing a basic graph property such as connectivity, cycle presence or maximum clique size is a more relevant and attainable objective. Since property…

2017-09-20abs ↗pdf ↗

This paper shows that, away from 6, the kernel of the Witten genus is precisely the ideal consisting of (bordism classes of) Cayley plane bundles with connected structure group, but only after restricting the Witten genus to string bordism. It does so by showing that the divisibility properties of Cayley plane bundle c…

2011-11-19abs ↗pdf ↗

Study examines dependence properties of Bayesian neural network units in finite-width networks.

problem Understanding dependence properties of hidden units in practical finite-width Bayesian neural networks.
method Theoretical analysis and empirical evaluation of depth and width impacts.
result Hidden units in finite-width Bayesian neural networks are dependent, contrary to the infinite-width limit assumption.

The Goresky-Hingston coproduct was first introduced by D. Sullivan and later extended by M. Goresky and N. Hingston. In this article we give a Morse theoretic description of the coproduct. Using the description we prove homotopy invariance property of the coproduct. We describe a connection between our Morse theoretic …

2017-11-19abs ↗pdf ↗

The study shows that several properties are not profinite invariants.

problem Determining which properties are profinite invariants.
method Combining Rips constructions and iterated group-theoretic Dehn filling on hyperbolic virtually special groups.
result Several properties (stable commutator length, quasimorphisms, property NL, property FW_\infty, property FA, and non-abelian free subgroups) are not profinite invariants.

The paper explores stability and generalization of deep GCNs.

problem Understanding the stability and generalization of deep GCNs from a theoretical perspective.
method Theoretical analysis of stability and generalization properties of deep GCNs.
result The stability and generalization of deep GCNs are influenced by the maximum absolute eigenvalue of the graph filter operators and the depth of the network.

The paper explores higher property T in lattices and its connections to geometric phenomena.

problem Understanding higher property T in lattices and related geometric phenomena.
method Operator-algebraic characterizations of higher property T and connections to lattice geometry.
result Unified framework for understanding higher property T and related geometric phenomena.

This work analyzes statistical properties of SAM, showing it outperforms GD.

problem Improving deep neural network generalization through flatter solutions.
method Directly studies statistical performance of Sharpness-Aware Minimization (SAM).
result SAM has smaller prediction error than Gradient Descent (GD) under certain conditions.

The staircase property aids deep learning by guiding hierarchical feature learning.

problem Understanding how hierarchical structure influences deep learning performance.
method Defined and proved the staircase property for Boolean hypercube functions, and showed its learnability by layerwise stochastic coordinate descent.
result Staircase functions can be learned in polynomial time using layerwise stochastic coordinate descent on regular neural networks.

Persistent homology enhances graph classification by capturing long-range graph properties.

problem Lack of formal assessment of persistent homology in graph learning.
method Brief introduction and theoretical discussion of persistent homology in graph context, followed by empirical analysis.
result Persistent homology improves graph classification, especially for data with prominent topological structures.

PRI-VAE learns disentangled representations by optimizing principle-of-relevant-information.

problem Learning disentangled representations under VAE framework remains unknown.
method Proposes PRI-VAE, a novel learning objective to optimize disentanglement.
result Demonstrates effectiveness of PRI-VAE on four benchmark datasets.

In the last decade, the approximate vanishing ideal and its basis construction algorithms have been extensively studied in computer algebra and machine learning as a general model to reconstruct the algebraic variety on which noisy data approximately lie. In particular, the basis construction algorithms developed in ma…

2019-11-11abs ↗pdf ↗

Conjecture Z\mathbb{Z} is a knot theoretical equivalent form of the Kervaire Conjecture. We say that a knot have property Z\mathbb{Z} if it satisfies Conjecture Z\mathbb{Z} for that specific knot. In this work, we show that alternating Montesinos knots with three tangles have property Z\mathbb{Z}. We also show that…

2016-06-22abs ↗pdf ↗

Every closed orientable surface S has the following property: any two connected covers of S of the same degree are homeomorphic (as spaces). In this, paper we give a complete classification of compact 3-manifolds with empty or toroidal boundary which have the above property. We also discuss related group-theoretic ques…

2018-07-25abs ↗pdf ↗

Recent advances in Reinforcement Learning, grounded on combining classical theoretical results with Deep Learning paradigm, led to breakthroughs in many artificial intelligence tasks and gave birth to Deep Reinforcement Learning (DRL) as a field of research. In this work latest DRL algorithms are reviewed with a focus …

2019-06-24abs ↗pdf ↗

Properties of low-variability periods in the time series are analysed. The theoretical approach is used to show the relationship between the multi-scaling of low-variability periods and multi-affinity of the time series. It is shown that this technically simple method is capable of reveling more details about time-seri…

2004-06-09abs ↗pdf ↗

The asymptotic behavior of the heat kernel of a Riemannian manifold gives rise to the classical concepts of parabolicity, stochastic completeness (or conservative property) and Feller property (or C0C^{0}-diffusion property). Both parabolicity and stochastic completeness have been the subject of a systematic study whic…

2010-10-08abs ↗pdf ↗

RotEqNet preserves rotation symmetry in fluid systems using high-order tensors.

problem Lack of rotational symmetry in machine learning models for fluid systems.
method Introduces RotEqNet, a network that guarantees rotation-equivariance for high-order tensors.
result RotEqNet reduces errors and maintains rotation-equivariance in fluid systems.

Risk measures such as Expected Shortfall (ES) and Value-at-Risk (VaR) have been prominent in banking regulation and financial risk management. Motivated by practical considerations in the assessment and management of risks, including tractability, scenario relevance and robustness, we consider theoretical properties of…

2018-08-22abs ↗pdf ↗

We consider different levels of complexity which are observed in the empirical investigation of financial time series. We discuss recent empirical and theoretical work showing that statistical properties of financial time series are rather complex under several ways. Specifically, they are complex with respect to their…

2001-04-19abs ↗pdf ↗

The grassmannian of hermitian lagrangian spaces in CnCn\mathbb{C}^n\oplus \mathbb{C}^n is a natural compactification of the space of hermitian n×nn\times n matrices. We describe a Schubert-like, Whitney regular stratification on this space which has a Morse theoretic origin. We prove that these strata define closed subana…

2007-08-20abs ↗pdf ↗

Proposes Stochastic-Sign SGD for federated learning with theoretical guarantees.

problem Developing efficient, private, and resilient parameter estimation methods for federated learning.
method Introduces Stochastic-Sign SGD, a novel method based on SIGNSGD, which addresses convergence and communication efficiency.
result Demonstrates the effectiveness of Stochastic-Sign SGD through experiments on MNIST and CIFAR-10 datasets.

Unified framework for stable RL learning with theoretical guarantees.

problem Lack of systematic theoretical principles guiding RL post-training methods.
method Unified theoretical framework for policy-gradient estimators and optimization algorithms.
result Establishes unbiasedness, variance expressions, and convergence guarantees.

Generative Adversarial Networks (GANs) are a class of generative algorithms that have been shown to produce state-of-the art samples, especially in the domain of image creation. The fundamental principle of GANs is to approximate the unknown distribution of a given data set by optimizing an objective function through a…

2018-03-21abs ↗pdf ↗

Deep neural networks are often used to implement powerful generative models for real-world data. Notable applications include image denoising, as well as other classical inverse problems like compressed sensing and super-resolution. To provide a rigorous but simplified analysis of generative models, in this work, we in…

2018-03-25abs ↗pdf ↗