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

3617231,0841,445 · Jun 202019922001200920172026
48 results for explicit model

Proposes a new model for better speech segmentation.

problem Improving speech segmentation accuracy.
method Integrates recurrent explicit duration variables into rSLDS and uses Pólya-gamma augmentation for inference.
result Demonstrates improved segmentation on various datasets.

Paper proposes an efficient method to optimize neural networks without backpropagation.

problem Computational inefficiency and scalability issues in neural network optimization.
method Derives explicit solutions to optimize neural networks, reducing computational costs.
result Explicit solutions achieve near-optimality and can discover better optima than backpropagation.

We use filtrations of the Grassmannian model to produce explicit algebraic formulae for all harmonic maps of finite uniton number from a Riemann surface, and so all harmonic maps from the 2-sphere, to the unitary group for a general class of factorizations by unitons. We show how these specialize to give explicit formu…

2009-09-30abs ↗pdf ↗

User preferences for items can be inferred from either explicit feedback, such as item ratings, or implicit feedback, such as rental histories. Research in collaborative filtering has concentrated on explicit feedback, resulting in the development of accurate and scalable models. However, since explicit feedback is oft…

2011-09-27abs ↗pdf ↗

This work improves neural network calibration using explicit regularization.

problem Improving predictive uncertainty in neural networks.
method Introducing a probabilistic calibration measure and exploring explicit regularization techniques.
result Explicit regularization improves log-likelihood and predictive uncertainty.

We consider conditional-mean hedging in a fractional Black-Scholes pricing model in the presence of proportional transaction costs. We develop an explicit formula for the conditional-mean hedging portfolio in terms of the recently discovered explicit conditional law of the fractional Brownian motion.

2017-05-05abs ↗pdf ↗

DEQs and explicit networks are nearly equivalent for Gaussian mixtures.

problem Understanding the equivalence between DEQs and explicit neural networks.
method Random matrix theory and analysis of kernel matrices.
result A shallow explicit network can mimic the kernel of a DEQ.

Efficient neural network optimization reduces costs and improves model performance.

problem High computational costs in optimizing neural networks, especially at scale.
method Introduces self-attentive feed-forward neural units (SAFFU) for efficient optimization.
result Explicit solutions outperform models optimized by backpropagation alone, and further training with backpropagation leads to better optima from smaller data sets.

Research aims to ensure fair classification across explicit and implicit sensitive features.

problem Ensuring fairness in machine learning models when sensitive features are not explicitly provided.
method Defined explicit and implicit cohorts, used clustering of embeddings, modified loss function.
result Improved classification parity across explicit and implicit sensitive features.

Ghost points affect stability in finite difference schemes for diffusion equations.

problem Impact of ghost points on stability of finite difference schemes.
method Exploration of explicit Euler finite difference scheme with ghost points on diffusion equation.
result Stability of the scheme is affected by ghost points.

Researchers develop explicit approximations for European put options in stochastic volatility models.

problem Developing accurate approximations for European put option prices in stochastic volatility models.
method Exploits expansions of the mixing representation of the put option price using Malliavin calculus.
result Explicit formulas for option prices and error bounds are derived, with closed-form solutions under piecewise-constant parameters.

Bayesian model fuses multiple classifiers with explicit correlation modeling.

problem Combining outputs of multiple classifiers with explicit correlation.
method Hierarchical Bayesian model with correlated Dirichlet distribution.
result Fused classifier performance can be Bayes optimal even for highly correlated base classifiers.

By investigating model-independent bounds for exotic options in financial mathematics, a martingale version of the Monge-Kantorovich mass transport problem was introduced in \cite{BeiglbockHenry LaborderePenkner,GalichonHenry-LabordereTouzi}. In this paper, we extend the one-dimensional Brenier's theorem to the present…

2013-02-20abs ↗pdf ↗

Families of explicit solutions are found to a nonlinear Black-Scholes equation which incorporates the feedback-effect of a large trader in case of market illiquidity. The typical solution of these families will have a payoff which approximates a strangle. These solutions were used to test numerical schemes for solving …

2006-04-05abs ↗pdf ↗

Constructs explicit solutions to Spin(7)-structures gradient flow.

problem Finding explicit solutions to Spin(7)-structures gradient flow.
method Expressed Spin(7)-torsion tensor and gradient flow in terms of torsion forms; used these formulae to find solutions.
result Found explicit solutions including a shrinking soliton on SU(3) and another on a T7T^7-bundle over S1S^1.

Develops a new framework to analyze gradient flow regimes and derive explicit solutions.

problem Analyzing scaling regimes and deriving explicit analytic solutions for gradient flow in large learning problems.
method Formal power series expansion of the loss evolution with coefficients encoded by diagrams.
result Reveals different learning phases and obtains explicit solutions in some cases.

ADSGD method speeds up model identification in sparse optimization.

problem Implicit model identification in sparse optimization problems.
method Accelerated Doubly Stochastic Gradient Method (ADSGD) for faster explicit model identification.
result ADSGD achieves faster explicit model identification and improved algorithm efficiency.

Markov switching models (MSMs) are probabilistic models that employ multiple sets of parameters to describe different dynamic regimes that a time series may exhibit at different periods of time. The switching mechanism between regimes is controlled by unobserved random variables that form a first-order Markov chain. Ex…

2019-09-12abs ↗pdf ↗

Machine learning improves implicit solvent models for molecular dynamics.

problem Accurate modeling of solvent effects for biological molecules is challenging.
method Leveraging machine learning and multi-scale coarse graining, ISSNet models implicit solvent potentials.
result ISSNet models outperform traditional methods in reproducing protein thermodynamics.

Noise injection before gradient steps helps in regularization for neural networks.

problem Improving generalization in overparametrized neural networks.
method Injecting small noise perturbations before computing gradient steps, especially in layer-wise fashion.
result Small noise perturbations can explicitly regularize neural networks without variance explosion.

Study consumption-investment problem in markets with rank-based returns.

problem Consumption-investment problem in markets with rank-based returns.
method Derives an HJB equation with Neumann boundary conditions for the value function and proves a corresponding verification theorem.
result Explicit solutions for unconstrained, open market constraints, and fully invested cases.

Study of CR twistor model Q2,2Q^{2,2} and its sections.

problem Classify and describe projective lines and hyperplane sections of the CR twistor model.
method Explicit projective methods, classification of lines and sections, use of involution jj.
result Complete relative classification of smooth quadric sections and explicit non-spherical CR structures.

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.

In 'A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options', Heston proposes a Stochastic Volatility (SV) model with constant interest rate and derives a semi-explicit valuation formula. Heston also describes, in general terms, how the model could be extended to inc…

2018-09-24abs ↗pdf ↗

Generative Bayesian Filtering improves inference in complex models without explicit density evaluations.

problem Performing posterior inference in complex nonlinear and non-Gaussian state-space models.
method Generative Bayesian Filtering (GBF) extends GBC to dynamic settings using deep neural networks for recursive posterior inference. Generative-Gibbs sampler bypasses density evaluations for parameter learning.
result GBF significantly outperforms likelihood-free approaches in accuracy and robustness for intractable state-space models.