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

3997981,1961,595 · Jun 202019922001200920172026
48 results for theoretical model

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.

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 ↗

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.

Theoretical study shows AI models can recover from contaminated training data.

problem Data contamination in AI training can degrade model performance.
method Theoretical analysis and experiments on various data types.
result Models converge to true distribution under mild conditions, with rate dependent on real data fraction.

Theoretical analysis of deep neural networks for time series data.

problem Theoretical development for deep neural networks on temporally dependent observations is lacking.
method Established non-asymptotic bounds for prediction error of deep neural networks under mixing-type assumptions.
result Deep neural networks can model non-linear time series data with additional logarithmic factors due to dependence.

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.

Bayesian MAML outperforms MAML in meta learning tasks with theoretical guarantees.

problem Theoretical understanding of Bayesian MAML's superiority over MAML.
method Comparison of meta test risks between Bayesian MAML and MAML in meta linear regression.
result Bayesian MAML has provably lower meta test risks than MAML in both distribution agnostic and linear centroid cases.

The Heston model is validated for option pricing using theoretical derivations and empirical market data.

problem Validating the Heston model for accurate option pricing.
method Theoretical derivations and empirical validations using Monte Carlo simulations and machine learning.
result The Heston model is robust and relevant for current financial markets.

Consistency models accelerate generation with theoretical guarantees.

problem Empirical success of consistency models without theoretical justification.
method Theoretical analysis of consistency models mapping inputs to arbitrary points.
result Achieve KL divergence of order O(ε2) O(\varepsilon^2) with $ O\left(\log\left(\frac{d}{\varepsilon} ight) ight) $ iterations.

The paper establishes theoretical foundations for low-rank knowledge distillation in LLMs.

problem Understanding the theoretical underpinnings of low-rank knowledge distillation in LLMs.
method Theoretical framework for low-rank knowledge distillation, including convergence rates and generalization bounds.
result Theoretical analysis reveals optimal rank r=O(n)r^* = O(\sqrt{n}) for minimizing generalization error.

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.

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.

Theoretical analysis shows MDMs can be efficient but not for all metrics.

problem Understanding the efficiency-accuracy trade-off of diffusion language models.
method Theoretical analysis of Masked Diffusion Model (MDM) using perplexity and sequence error rate as metrics.
result MDM achieves near-optimal perplexity but requires linear scaling for sequence error rate, highlighting efficiency-accuracy trade-offs.

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}).

This paper analyzes speculative decoding, a method to speed up large language model inferences.

problem Theoretical understanding of speculative decoding is lacking.
method Conceptualizes speculative decoding as a markov chain problem and studies its key properties.
result Reveals fundamental connections between LLM components and their impact on decoding efficiency.

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.

This paper establishes a theoretical foundation for consistency training in diffusion models.

problem Lack of a comprehensive theoretical understanding of consistency training in diffusion models.
method Demonstrates the necessity of a number of steps in consistency learning exceeding d5/2/εd^{5/2}/\varepsilon for generating samples within ε\varepsilon proximity to the target distribution.
result Establishes rigorous insights into the validity and efficacy of consistency models, offering theoretical underpinnings for their utility.

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 ↗

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 ↗

New method uses dynamic programming for meta continual learning.

problem Challenges of generalization and catastrophic forgetting in sequential learning.
method Developed a theoretical framework using dynamic programming for meta continual learning.
result Theoretical and practical method achieves better accuracy than existing methods.

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.

Paper introduces a new generative learning model using Schrödinger bridge diffusion in latent space.

problem Learning distributions from divergent data distributions.
method Pre-training with large-scale models, Schrödinger bridge diffusion model in latent space.
result Effective control of second-order Wasserstein distance between generated and target distributions.

Clarifies model-based RL's theoretical issues and counterexamples for popular losses.

problem Model-based reinforcement learning's empirical performance vs. theoretical properties and popular loss functions.
method Analyzes empirical and theoretical aspects of model-based RL and constructs counterexamples for losses.
result MuZero loss fails in stochastic and deterministic environments, leading to exponential sample complexity.

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 ↗

Information-theoretic Bayesian optimisation techniques have demonstrated state-of-the-art performance in tackling important global optimisation problems. However, current information-theoretic approaches require many approximations in implementation, introduce often-prohibitive computational overhead and limit the choi…

2017-11-02abs ↗pdf ↗

This research provides theoretical guarantees for hyperparameter estimation in complex network dynamical systems.

problem Theoretical guarantees for hyperparameter estimation in large, inhomogeneous complex network dynamical systems.
method Formulating the system's evolution in a measure transport perspective, proposing a theoretical framework for estimating hyperparameters with mean-type observations.
result A nonasymptotic bound for the deviation of hyperparameter estimates in inhomogeneous complex network dynamical systems with respect to network population size.

Boosted additive models reveal new insights and potential pathologies.

problem Theoretical understanding of boosted additive models (BAMs) and their convergence behavior.
method Study of solution paths of BAMs and derivation of convergence results.
result Uncovering pathologies of boosting for certain additive model classes.

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.

This paper improves generative models by using data scaling and theoretical analysis.

problem Challenges in selecting noise distributions for stable learning in generative models.
method Introduces Scale-GAN, which uses data scaling and variance-based regularization.
result Data scaling controls the bias-variance trade-off and improves stability and accuracy.

Game-theoretic model captures investor interactions for stock price forecasting.

problem Complex market dynamics driving stock price movements.
method Game-theoretic modeling of heterogeneous investor interactions in a dynamic graph structure.
result Our method outperforms state-of-the-art stock price forecasting methods.

Unsupervised pre-training improves model generalization, but lacks theoretical understanding.

problem Lack of theoretical understanding of unsupervised pre-training's impact on model generalization.
method Introduces a novel theoretical framework to analyze and enhance generalization.
result Enhances understanding of unsupervised pre-training and fine-tuning, proposing a new regularization method.

The paper introduces PD learning to improve deep learning theory.

problem Lack of theoretical understanding in deep learning model fitting and generalization.
method Proposes a PD learning framework to analyze optimization and generalization mechanisms of deep learning.
result Established theoretical guarantees on optimizability and derived generalization error bounds.

Despite widespread interest and practical use, the theoretical properties of random forests are still not well understood. In this paper we contribute to this understanding in two ways. We present a new theoretically tractable variant of random regression forests and prove that our algorithm is consistent. We also prov…

2013-10-04abs ↗pdf ↗

Theoretical framework explains why few epochs are enough for LLM fine-tuning.

problem Understanding why few epochs are sufficient for LLM fine-tuning.
method Combining early stopping theory with attention-based Neural Tangent Kernel (NTK) for LLMs.
result Formalizes convergence rate of attention-based fine-tuning with respect to sample size.

Theoretical study shows adversarial training improves robustness in deep learning models.

problem Ensuring robustness in pre-trained deep learning models.
method Theoretical analysis of adversarial training and feature purification in two-layer neural networks.
result Adversarial training leads to feature purification, making models more robust to attacks.