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

2535077601,013 · Jun 202019922001200920172026
48 results for Theoretical study

Study explores learning behavior of GFlowNets, revealing key mechanisms.

problem Lack of theoretical understanding of GFlowNets' learning dynamics.
method Rigorous theoretical investigation of four dimensions: convergence, sample complexity, implicit regularization, and robustness.
result Elucidates mechanisms underlying GFlowNet's learning dynamics, providing insights into performance factors.

The study initiates a theoretical analysis of dynamic benchmarking models.

problem Lack of theoretical foundation and empirical studies in dynamic benchmarks.
method Examined two realizations of dynamic benchmarking: sequential and hierarchical dependency models.
result Sequential dynamic benchmarks show initial performance improvement but can stall after three rounds due to label noise.

We study the task of online boosting--combining online weak learners into an online strong learner. While batch boosting has a sound theoretical foundation, online boosting deserves more study from the theoretical perspective. In this paper, we carefully compare the differences between online and batch boosting, and pr…

2012-06-27abs ↗pdf ↗

We conjecture a Verlinde type formula for the moduli space of Higgs sheaves on a surface with a holomorphic 2-form. The conjecture specializes to a Verlinde formula for the moduli space of sheaves. Our formula interpolates between KK-theoretic Donaldson invariants studied by the first named author and Nakajima-Yoshiok…

2019-03-09abs ↗pdf ↗

This paper explains the theoretical inductive bias of Isolation Forest.

problem Lack of theoretical foundation explaining Isolation Forest's success.
method Formulated the growth process of iForest as a random walk, derived expected depth function using transition probabilities.
result Established a theoretical understanding of iForest's effectiveness and parameter adaptability.

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.

Paper studies the theoretical equivalence between implicit and explicit neural networks in high dimensions.

problem Lack of theoretical analysis of implicit and explicit neural networks.
method Examined high-dimensional implicit neural networks and established their equivalence to explicit networks.
result Equivalence between implicit and explicit neural networks in high dimensions.

Study reveals mutual information is crucial for understanding algorithm performance in stochastic convex optimization.

problem Uncertainty in capturing the exceptional performance of learning algorithms using existing information-theoretic generalization bounds.
method Examined the relationship between mutual information and generalization in stochastic convex optimization.
result Mutual information is necessary for true risk minimization in stochastic convex optimization, indicating existing bounds fall short.

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.

Stochastic volatility models describe asset prices StS_t as driven by an unobserved process capturing the random dynamics of volatility σtσ_t. Here, we quantify how much information about σtσ_t can be inferred from asset prices StS_t in terms of Shannon's mutual information I(St:σt)I(S_t : σ_t). This motivates a careful nume…

2015-12-28abs ↗pdf ↗

In this paper we study the learnability of deep random networks from both theoretical and practical points of view. On the theoretical front, we show that the learnability of random deep networks with sign activation drops exponentially with its depth. On the practical front, we find that the learnability drops sharply…

2019-04-08abs ↗pdf ↗

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.

The goal of this paper is not to introduce a single algorithm or method, but to make theoretical steps towards fully understanding the training dynamics of generative adversarial networks. In order to substantiate our theoretical analysis, we perform targeted experiments to verify our assumptions, illustrate our claims…

2017-01-17abs ↗pdf ↗

Survey on multiplayer bandits, highlighting theoretical gaps and future directions.

problem Theoretical advancements in multiplayer bandits lack practical implementation in real-world scenarios.
method Organizes and contextualizes existing literature on multiplayer bandits.
result Clear directions for future research in adapting theoretical algorithms to real-world situations.

Study gauge theory of real and quaternionic parabolic bundles over real curves.

problem Examining gauge theoretic aspects of real and quaternionic parabolic bundles over real curves.
method Investigate orbits of connections under gauge groups for fixed real or quaternionic structures.
result Gauge-theoretic quotients of real or quaternionic connections are inside the real points of moduli of holomorphic bundles.

This study connects Jacobian regularization to adversarial robustness and improves generalization.

problem Adversarial attacks make deep neural networks vulnerable.
method Developed a connection between Jacobian regularization and adversarial training, and established robust generalization gaps.
result Jacobian norms are related to both standard and robust generalization.

The paper explores game-theoretic alignment of LLMs with human preferences, finding limitations and conditions.

problem Aligning LLMs with human preferences using game theory.
method Systematic study of payoff choices in a two-player zero-sum game for desirable alignment properties.
result Impossibility of preference matching in game-theoretic LLM alignment under standard assumptions.

This paper provides theoretical guarantees for SPCA using the Elastic Net.

problem Lack of theoretical guarantees for the SPCA algorithm.
method Revisited and improved the SPCA algorithm of Zou et al. (2006) using the Elastic Net.
result Both algorithms can recover the principal subspace consistently under mild conditions.

This article presents a theoretical model for a dynamic system based on sustainable development. Due to the relatively absence of theoretical studies and practical issues in the area of sustainable development, Romania aspires to the principles of sustainable development. Based on the concept as a process in which econ…

2011-02-28abs ↗pdf ↗

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.

Theoretical study on AI models' resilience to data contamination during recursive training.

problem Data contamination in recursive training of generative AI models.
method General framework with minimal assumptions on real data distribution and flexible generative models.
result Contaminated recursive training converges with a rate equal to the minimum of baseline model's rate and contamination fraction.

Transfer learning has been proven effective when within-target labeled data is scarce. A lot of works have developed successful algorithms and empirically observed positive transfer effect that improves target generalization error using source knowledge. However, theoretical analysis of transfer learning is more challe…

2018-10-14abs ↗pdf ↗

The paper explores the information-theoretic nature of excess risk in machine learning.

problem Understanding the excess risk in machine learning models.
method Formulates the minimax excess risk as a zero-sum game and modifies it to allow swapping of the order of play.
result Proves that under certain conditions, the duality gap is zero, allowing for the application of Bayesian results to provide bounds on minimax excess risk.

The paper explores dual learning, a technique that improves machine translation and image transformation.

problem Understanding and improving dual learning's effectiveness and conditions.
method Theoretical analysis and algorithmic extension of dual learning.
result Multi-step dual learning boosts performance under mild conditions.

New framework for discrete-state diffusion models reduces sample complexity.

problem Lack of theoretical understanding and sample complexity analysis for discrete-state diffusion models.
method Developed a principled theoretical framework, decomposing score estimation error.
result Established sample complexity bound of O~(ε2)\widetilde{\mathcal{O}}(ε^{-2}).

Improved VB algorithm for high-dimensional logistic regression with theoretical guarantees.

problem Sparse high-dimensional logistic regression model selection.
method Spike and slab variational Bayes approximation.
result Optimal convergence rates in 2\ell_2 and prediction loss for sparse truths.

Theoretical study on how model architecture affects contrastive learning performance.

problem Understanding the role of model architecture in self-supervised learning.
method Theoretical analysis of contrastive learning, focusing on model capacity and clustering structures.
result Contrastive representations have lower dimensionality than the number of clusters in the data distribution.

We analyze oversquashing in topological message-passing using relational structures.

problem Oversquashing in topological message-passing remains understudied.
method A unifying axiomatic framework that bridges graph and topological message-passing.
result Potential to advance topological deep learning.

Proposes a new theoretical framework for PbRL that requires less human feedback.

problem Lack of theoretical work capturing practical PbRL frameworks.
method Introduces a reward-agnostic PbRL framework that acquires exploratory trajectories before human feedback.
result Demonstrates improved sample complexity for learning optimal policies in linear and low-rank MDPs.

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.

Study robust mean estimation under coordinate-level corruptions using Hamming distance.

problem Robust mean estimation under realistic coordinate-level corruptions.
method Introduce a novel Hamming distance-based measure and present information-theoretic analysis.
result Data cleaning-inspired approaches can match information theoretic bounds for robust mean estimation.

New research shows existing information-theoretic methods can't establish minimax rates for gradient descent in stochastic convex optimization.

problem Establishing minimax rates for gradient descent in stochastic convex optimization using information-theoretic methods.
method Examined several information-theoretic frameworks including input-output mutual information bounds, conditional mutual information bounds, PAC-Bayes bounds, and their variants.
result Proved that none of the examined information-theoretic frameworks can establish minimax rates for gradient descent in stochastic convex optimization.