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

Trend · papers per month

3567111,0671,422 · Jun 202019922001200920172026
48 results for deterministic models

Reinforcement learning algorithms such as the deep deterministic policy gradient algorithm (DDPG) has been widely used in continuous control tasks. However, the model-free DDPG algorithm suffers from high sample complexity. In this paper we consider the deterministic value gradients to improve the sample efficiency of …

2019-09-09abs ↗pdf ↗

We convert deterministic flow models to stochastic samplers.

problem Deterministic flow models are sensitive to errors and cannot condition on intermediate states.
method Transform ODEs into SDEs with the same marginal distributions.
result Empirically outperforms deterministic samplers and controls generation diversity.

This paper benchmarks speech LVMs against deterministic models and adapts a video model to speech.

problem Speech generation models are inferior to deterministic models.
method Developed a speech benchmark of LVMs and compared them against deterministic models.
result The Clockwork VAE outperforms previous LVMs and reduces the gap to deterministic models.

We study a reinforcement learning setting, where the state transition function is a convex combination of a stochastic continuous function and a deterministic function. Such a setting generalizes the widely-studied stochastic state transition setting, namely the setting of deterministic policy gradient (DPG). We firstl…

2018-07-10abs ↗pdf ↗

Study shows deterministic equivalent for neural network kernel convergence.

problem Understanding convergence of neural network kernels.
method Analyzes empirical spectral distribution of Conjugate Kernel, proving convergence to a deterministic limit.
result Obtains a deterministic equivalent for the Stieltjes transform and resolvent of the Conjugate Kernel.

Paper presents a deterministic method for diverse subset selection.

problem Diverse subset selection problems in recommendation, summarization, and search.
method Greedy deterministic adaptation of k-DPP for low-rank approximations and image search.
result The method yields low-rank approximations of kernel matrices and demonstrates effectiveness in image search.

Develops DPG methods for continuous-time RL with deterministic policies.

problem High variance and slow convergence in stochastic policy RL methods.
method Derives continuous-time policy gradient formula and proposes CT-DDPG algorithm.
result CT-DDPG achieves superior stability and faster convergence in continuous-time RL.

We resolve the open problem of optimal sample complexity for multicalibration and deterministic predictors.

problem Optimal sample complexity for multicalibration and deterministic predictors
method Minimax-optimal multicalibration algorithm and generalization to OI predictors
result Minimax-optimal multicalibration algorithm and deterministic predictors with optimal sample complexity

Variational autoencoders are prominent generative models for modeling discrete data. However, with flexible decoders, they tend to ignore the latent codes. In this paper, we study a VAE model with a deterministic decoder (DD-VAE) for sequential data that selects the highest-scoring tokens instead of sampling. Determini…

2020-03-04abs ↗pdf ↗

The seemingly stochastic transient dynamics of neocortical circuits observed in vivo have been hypothesized to represent a signature of ongoing stochastic inference. In vitro neurons, on the other hand, exhibit a highly deterministic response to various types of stimulation. We show that an ensemble of deterministic le…

2013-11-13abs ↗pdf ↗

Develops a deterministic method to approximate NSDEs for better uncertainty quantification.

problem Computational infeasibility of obtaining well-calibrated uncertainty from NSDEs.
method Bidimensional moment matching algorithm for approximating NSDE transition kernel.
result Deterministic approximation improves uncertainty calibration and prediction accuracy.

A deterministic apple tasting learner is developed, confirming a conjecture and providing tight bounds for mistake bounds.

problem Determining the learnability of hypothesis classes in binary online classification with apple tasting feedback.
method Developed a deterministic apple tasting learner and proved tight bounds for mistake bounds.
result Deterministic apple tasting is feasible and provides tight bounds for mistake bounds.

Ever since the proof of asymptotic normality of maximum likelihood estimator by Cramer (1946), it has been understood that a basic technique of the Taylor series expansion suffices for asymptotics of MM-estimators with smooth/differentiable loss function. Although the Taylor series expansion is a purely deterministic …

2018-09-13abs ↗pdf ↗

Extends linear structural causal models to include deterministic relations and latent confounders for causal discovery.

problem Causal discovery in linear SCMs with deterministic relations and latent confounders.
method Extended existing results to include deterministic relations and latent confounders, derived necessary and sufficient conditions for unique identifiability, proposed an algorithm for recovery.
result First work on identifiability results for causal discovery under latent confounding and deterministic relationships.

Develops new bounds for deterministic samplers in diffusion models.

problem Analyzing deterministic samplers in diffusion generative models.
method Operational interpretation of deterministic sampling; restoration and degradation steps.
result First polynomial convergence bounds for DDIM-type samplers.

We consider an individual or household endowed with an initial capital and an income, modeled as a deterministic process with a continuous drift rate. At first, we model the discounting rate as the price of a zero-coupon bond at zero under the assumption of a short rate evolving as an Ornstein-Uhlenbeck process. Then, …

2016-03-31abs ↗pdf ↗

sFML learns stochastic dynamical systems from data.

problem Learning unknown stochastic dynamical systems from measurement data.
method sFML extends FML for deterministic systems, using a stochastic flow map composed of deterministic and stochastic sub-maps.
result sFML constructs a stochastic evolution model approximating unknown stochastic systems.

Develops a new reinforcement learning framework for complex control problems.

problem Continuous-time extended mean field control with deterministic policies.
method Model-free sensitivity formula, deterministic policy gradient, local value and advantage-rate representations.
result Demonstrates efficiency, stability, and robustness in solving complex control problems.

State-space systems generate probabilistic dependencies between inputs and outputs.

problem Understanding probabilistic dependencies in state-space systems.
method Introducing a probabilistic framework and proving sufficient conditions for output existence and uniqueness.
result State-space systems can generate probabilistic dependencies, even without functional relations.

We empirically evaluate a stochastic annealing strategy for Bayesian posterior optimization with variational inference. Variational inference is a deterministic approach to approximate posterior inference in Bayesian models in which a typically non-convex objective function is locally optimized over the parameters of t…

2015-05-25abs ↗pdf ↗

New algorithms reduce regret in both stochastic and deterministic environments.

problem Designing algorithms that perform well in both types of MDPs.
method Proposed new environment norms and algorithms with variance-dependent regret bounds.
result First algorithm with simultaneously optimal bounds for both stochastic and deterministic MDPs.

New methods estimate policy value and gradients for deterministic policies from off-policy data.

problem Estimating policy value and gradients for deterministic policies from off-policy data.
method Proposed new doubly robust estimators based on kernelization approaches.
result Demonstrated a rate independent of horizon length for policy value and gradient estimation.

Hamiltonian dynamics-based algorithms achieve deterministic and accelerated convergence for convex optimization.

problem Accelerating convex optimization
method Hamiltonian dynamics
result Hamiltonian dynamics-based algorithms achieve deterministic and accelerated convergence for convex optimization.

PAC-Bayesian framework for fairness in stochastic and deterministic classifiers.

problem Theoretical guarantees on fairness for balancing predictive risk and fairness constraints.
method PAC-Bayesian framework for both stochastic and deterministic classifiers, covering a broad class of fairness measures.
result Derives generalization bounds for fairness, demonstrating tightness with empirical evaluation.

New model predicts dynamic tax evasion with audits and imitation.

problem Static treatment of tax compliance and evasion in Bertotti and Modanese model.
method Piecewise Deterministic Markov Processes (PDMPs) for audits and imitation mechanisms.
result Model shows persistent fluctuations and stationary distribution, not extreme equilibrium.

Paper proposes efficient algorithm for recovering sparsity pattern from deterministic missing data.

problem Recovering sparsity pattern from datasets with deterministic missing structure.
method Proposes an efficient algorithm for missing value imputation using topological property of censorship filter.
result Consistently recovers the sparsity pattern with high probability in polynomial time and logarithmic sample complexity.

New method ensures consistent inference across different tensor parallel sizes for large language models.

problem Non-deterministic inference in large language models due to inconsistent reduction orders across GPUs.
method Tree-Based Invariant Kernels (TBIK) that align intra- and inter-GPU reduction orders through a unified hierarchical binary tree structure.
result Bit-wise identical results across different tensor parallel sizes for RL training.