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

316394125 · Jun 202019922001200920172026
48 results for double fitted

Serverless cloud computing speeds up double machine learning model estimation.

problem Efficiently estimating double machine learning models with minimal cloud resource management.
method Serverless computing with AWS Lambda for repeated cross-fitting.
result Demonstrates significant reduction in estimation times and costs.

Characterizes a specific type of Courant algebroid with a Calabi-Yau structure.

problem Understanding specific types of Courant algebroids with Calabi-Yau structures.
method Explains how a homotopy BV algebra with certain properties characterizes these algebroids.
result A Courant algebroid with a Calabi-Yau structure is a homotopy BV algebra with specific properties.

Recently, Rips produced an example of a double of two free groups which has unsolvable generalized word problem. In this paper, we show that Rips's example fits into a large class of doubles of groups, each member of which contains F_2 x F_2 and therefore has unsolvable generalized word problem and is incoherent.

1998-09-23abs ↗pdf ↗

Deep learning models can generalize well even when they fit training data perfectly.

problem Generalization in over-parameterized deep learning models.
method Combining empirical risk minimization with capacity control, exploring inductive biases and smooth empirical risk minimizers.
result Double descent phenomenon: test error can decrease after interpolation point.

We introduce a stochastic model to explain a double power-law distribution which exhibits two different Paretian behaviors in the upper and the lower tail and widely exists in social and economic systems. The model incorporates fitness consideration and noise fluctuation. We find that if the number of variables (e.g. t…

2011-03-10abs ↗pdf ↗

The study of quotient structures in multi-graded bundles, including double vector bundles.

problem Understanding quotients of multi-graded bundles, especially double vector bundles.
method Analyzing quotients as towers of affine bundles and constructing normal bundles.
result Any quotient of multi-graded bundles fits into a tower of affine bundles.

Improved estimators for causal inference using cross-fitting and undersmoothing.

problem Estimating expected conditional covariance in causal inference.
method Double cross-fit doubly robust (DCDR) estimators with undersmoothing for non-smooth nuisance functions.
result DCDR estimators achieve n\sqrt{n}-consistency and asymptotic normality under minimal conditions.

Double Lie algebroids were discovered by Kirill Mackenzie from the study of double Lie groupoids and were defined in terms of rather complicated conditions making use of duality theory for Lie algebroids and double vector bundles. In this paper we establish a simple alternative characterization of double Lie algebroids…

2012-06-16abs ↗pdf ↗

Develops a test for conditional local independence of counting processes.

problem Testing the hypothesis of conditional local independence among continuous time stochastic processes.
method Introduces a new functional parameter, the Local Covariance Measure (LCM), and proposes a test called (X)-LCT using nonparametric estimators and sample splitting or cross-fitting.
result The (X)-LCT test can be controlled uniformly with modest rates, and it works well without restrictive parametric assumptions.

Chernozhukov, Chetverikov, Demirer, Duflo, Hansen, and Newey (2016) provide a generic double/de-biased machine learning (DML) approach for obtaining valid inferential statements about focal parameters, using Neyman-orthogonal scores and cross-fitting, in settings where nuisance parameters are estimated using a new gene…

2017-01-30abs ↗pdf ↗

Study shows double descent curve in high-dimensional linear regression with random projections.

problem Understanding the generalization performance in high-dimensional settings with random projections.
method Fixed prediction problem, ridge regression estimator, minimum norm least-squares fit, random matrix theory, asymptotic equivalents.
result Exhibit a double descent curve for high-dimensional linear regression with random projections.

Non-negative matrix factorization (NMF) is a technique for finding latent representations of data. The method has been applied to corpora to construct topic models. However, NMF has likelihood assumptions which are often violated by real document corpora. We present a double parametric bootstrap test for evaluating the…

2017-11-19abs ↗pdf ↗

High-dimensional models can outperform simpler ones in causal inference.

problem Estimating average treatment effects with many covariates.
method High-dimensional linear regression and synthetic control with many control units.
result Adding more control units can improve imputation performance even when pre-treatment fit is perfect.

Deep networks can interpolate noisy data without losing generalization.

problem Characterizing the relationship between interpolation and generalization in overparameterized deep networks.
method Analyzing the loss landscape of neural network functions over volumes around training data points, varying model parameters and training epochs.
result Loss sharpness in the input space follows a double descent, with large models predicting noisy targets over larger volumes around training data points.

Regression models can interpolate noisy data and still perform well, contrary to the bias-variance tradeoff.

problem Understanding why overparametrized models can generalize well despite the bias-variance tradeoff.
method Analysis of minimum norm solutions and ridge regression, focusing on the smallest singular value of the regression matrix.
result Testing error exhibits double descent behavior as model order increases, contrary to the classical bias-variance tradeoff.

Research provides explicit NPV expressions for double barrier strategies.

problem Calculating expected NPVs of double barrier strategies for regular diffusions.
method Explicit expression using bivariate q-scale function with perturbation technique.
result Explicit expressions for expected NPVs are derived for certain cases.

We give a concise summary of the para-Hermitian geometry that describes a doubled target space fit for a covariant description of T-duality in string theory. This provides a generalized differentiable structure on the doubled space and leads to a kinematical setup which allows for the recovery of the physical spacetime…

2019-04-15abs ↗pdf ↗

Paper adapts DML for panel data, addressing unobserved heterogeneity.

problem Estimating causal effects with panel data and unobserved heterogeneity.
method Adapting double/debiased machine learning (DML) for panel data with predictive models based on correlated random effects.
result Predictive models based on correlated random effects within DML lead to accurate coefficient estimates.

Deep learning models can overfit noisy data without losing generalization.

problem Understanding the generalization of deep learning models in noisy data.
method Empirical investigation of epoch-wise double descent in fully connected neural networks trained on CIFAR-10 with 30% label noise.
result The model achieves strong re-generalization on test data after overfitting noisy training data, corresponding to a 'benign overfitting' state.

SHIFT improves robustness in estimating dose-response functions with heavy-tailed contamination.

problem Outliers bias estimates of average dose-response functions in heavy-tailed data.
method SHIFT combines cross-fit nuisance orthogonalization, Welsch-loss, and defensive OLS refit.
result SHIFT reduces RMSE from 1.03 to 0.33 on localized contamination test.

The paper develops methods to estimate treatment effects in sample selection models.

problem Evaluation of treatments when outcomes are only observed for a subpopulation due to sample selection or attrition.
method Combines selection-on-observables and instrumental variable assumptions with double machine learning for treatment evaluation.
result Proposed estimators are asymptotically normal and root-n consistent.

New method bypasses global fit for LISA's Galactic binaries, extracting population parameters directly.

problem Disentangling LISA's Galactic binary sources from backgrounds in a computationally intensive process.
method Simulation-based approach using normalizing flow to infer population parameters.
result Direct inference of population parameters from LISA's frequency strain series.

Overparameterized models generalize well despite fitting noisy data.

problem Understanding why overparameterized models generalize well despite fitting noisy data.
method Statistical signal processing perspective.
result Overparameterized models often outperform underparameterized models in test performance.

The paper uses Gaussian mixture models for Bayesian networks and proposes an optimization algorithm.

problem Modeling nodes in Bayesian networks with complex distributions.
method Gaussian mixture models combined with double iteration algorithm.
result The double iteration algorithm optimizes Gaussian mixture models effectively.

Two new algorithms improve Q* approximation in batch RL with linear error propagation.

problem Improving Q* approximation in batch reinforcement learning.
method Two novel algorithms that estimate Bellman error directly, without quadratic dependence.
result Linear-in-horizon error propagation for batch RL algorithms.

New geometric interpretation explains over-parameterized models and adversarial perturbations.

problem Geometric understanding of over-parameterized regression and adversarial perturbations.
method Alternative geometric interpretation of regression in feature space.
result Adversarial perturbations are a natural feature of biased models due to underlying geometry.

The paper explores how complex models can improve system identification beyond traditional limits.

problem Balancing model richness and spurious learning in system identification.
method Investigates the double-descent phenomenon in the context of dynamic systems.
result Complex models can improve system identification performance beyond the point of interpolation.

The model outperforms other models in option pricing, especially for short-term implied volatility.

problem Improper calibration and pricing of exotic options in financial models.
method Stochastic volatility model with double-exponential jumps, Fourier pricing techniques.
result The model outperforms other models in fitting the short-term implied volatility smile and pricing exotic options.

A new method improves estimation of COVID-19 vaccine effectiveness.

problem Estimating vaccine effectiveness under the test-negative design.
method A doubly robust estimator (TNDDR) using cross-fitting and machine learning.
result The TNDDR estimator is n\sqrt{n}-consistent, asymptotically normal, and doubly robust.

Improves DRL for long-term causal inference with semiparametric methods.

problem Efficient inference for policy values in nonparametric MDPs with stringent conditions.
method Semiparametric Double Reinforcement Learning (DRL) with superefficient nonparametric estimators.
result Relaxes overlap conditions and reduces high-dimensional density-ratio estimation.

Deep networks generalize well even when they fit training data perfectly, thanks to overparametrization.

problem Understanding generalization in overparametrized deep networks.
method Random features regression, asymptotic analysis, ensemble averaging.
result Bias remains constant beyond the interpolation threshold, while variance components decay with overparametrization.

Efficient exploration improves large language model performance with fewer queries.

problem Improving large language model performance with fewer human feedback queries.
method Sequentially generates queries, fits a reward model to feedback, uses double Thompson sampling with epistemic neural network uncertainty.
result Efficient exploration enables high performance with far fewer queries.

New method identifies uncertainty shocks in financial markets using revised VIX.

problem Traditional VIX fails to capture non-Gaussian, heavy-tailed asset returns.
method Fit a double-subordinated Normal Inverse Gaussian Levy process to S&P 500 option prices to construct a revised VIX.
result Revised VIX provides a more comprehensive measure of volatility reflecting extreme movements and heavy tails.

Study on determining metrics from minimal surface areas, extending earlier work.

problem Determining a Riemannian manifold with boundary from minimal surface areas.
method Linearized forward operator of minimal surface transform, double fibration transforms, Bolker condition.
result Invertibility of the minimal surface transform on analytic manifolds.

Proposes a new method using GANs for testing conditional independence.

problem High-dimensional conditional independence testing in statistics and machine learning.
method Double GANs framework to learn conditional distributions, then construct a test statistic.
result The test statistic is doubly robust and has asymptotic power approaching one.

The study analyzes a model for aggregate losses with dependent and overdispersed inter-losses times.

problem Analyzing aggregate loss models with dependent and overdispersed inter-losses times.
method The study uses a two-state Markovian arrival process (MAP2) and a Markov renewal process to model the inter-losses times. Severities are modeled using a heavy-tailed, double-Pareto Lognormal distribution. The model is estimated via direct maximization of the likelihood function.
result The model with dependence and overdispersion in inter-losses times leads to higher capital charges compared to a Poisson process.

A new decomposition explains over-parameterized models' counterintuitive behaviors.

problem Understanding predictive error in over-parameterized models.
method Introducing the Generalized Aliasing Decomposition (GAD) to explain predictive performance.
result The GAD decomposes predictive error into three parts: model insufficiency, data insufficiency, and generalized aliasing.

Model shows loss curve with two distinct exponents due to sparse activations.

problem Sparse activations impact neural network scaling laws.
method Introduced a model for neural scaling laws under sparse activations, derived asymptotic population loss, and analyzed gradient-descent dynamics.
result Loss curve exhibits double-descent peak near interpolation threshold with two distinct scaling exponents.