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

22446587 · Oct 202519922001200920172026
48 results for data-driven adjustments

New method approximates M-estimator and predictions without solving fixed-point equations.

problem Characterize behavior of M-estimator and predictions in single index models.
method Develops data-driven observable adjustments to proximal operators.
result Empirical distributions of M-estimator and predictions are approximated without solving fixed-point equations.

Paper tackles causal effect estimation in observational data with hidden variables.

problem Estimating causal effects in observational data with hidden confounders.
method Developed a theorem for local search to find superset of adjustment variables, proposing a data-driven algorithm.
result Proposed algorithm produces more accurate causal effect estimates than existing methods.

New algorithms improve community detection in network data with strong consistency.

problem Challenges in effectively adapting spectral clustering techniques and achieving strong consistency in label recovery.
method Proposed Thresholded Cosine Spectral Clustering (TCSC) and one-step Refined TCSC algorithms, with strong consistency proofs.
result One-step Refined TCSC achieves strong consistency in community detection under PABM, correctly recovering all labels with high probability.

Randomized methods of neural network learning suffer from a problem with the generation of random parameters as they are difficult to set optimally to obtain a good projection space. The standard method draws the parameters from a fixed interval which is independent of the data scope and activation function type. This …

2019-08-11abs ↗pdf ↗

Bayesian optimisation for dynamically adjusting learning rates in machine learning models.

problem Dynamic adjustment of learning rates schedules in machine learning models.
method Probabilistic model based on latent Gaussian processes and auto-/regressive formulation.
result Flexibly adjusts learning rates schedules to abrupt changes of behaviours.

b-LOAD extends local causal discovery with prior knowledge, improving causal effect estimation.

problem Local causal discovery struggles in data-scarce settings due to uncertainty and incomplete neighborhoods.
method b-LOAD incorporates prior knowledge directly into local structure learning, using Meek's rules to refine discovery.
result b-LOAD refines the admissible equivalence class and enlarges identifiable causal queries, improving causal effect estimation.

Develops a new method for uncertainty quantification in high-dimensional learning.

problem Challenges in uncertainty quantification in high-dimensional regression or learning problems.
method Data-driven approach for UQ that corrects bias terms from training data.
result Non-asymptotic confidence intervals that avoid overestimating uncertainty.

The performance of many algorithms in the fields of hard combinatorial problem solving, machine learning or AI in general depends on tuned hyperparameter configurations. Automated methods have been proposed to alleviate users from the tedious and error-prone task of manually searching for performance-optimized configur…

2019-06-18abs ↗pdf ↗

Auto..gov uses RL to automate DeFi governance, improving security and profitability.

problem Manual DeFi governance is prone to human bias and financial risks.
method Auto..gov employs a deep Q-network reinforcement learning strategy for semi-automated parameter adjustments.
result Auto..gov outperforms traditional governance methods by at least 14% in terms of protocol profitability.

Haircutting non-cash collateral has become a key element of the post-crisis reform of the shadow banking system and OTC derivatives markets. This article develops a parametric haircut model by expanding haircut definitions beyond the traditional value-at-risk measure and employing a double-exponential jump-diffusion mo…

2017-08-25abs ↗pdf ↗

This paper uses DRL to optimize liquidity in DeFi protocols, making markets more accessible.

problem Optimizing liquidity provisioning in decentralized finance protocols.
method Modeling liquidity provisioning as an MDP, training an agent with PPO to dynamically adjust positions.
result DRL-based strategy outperforms traditional heuristics in fee maximization and impermanent loss mitigation.

We develop methods to approximate derivatives for causal inference problems using data.

problem Estimating causal effects from data when distributions are not known.
method Constructive algorithm approximating Gateaux derivatives via finite differencing.
result Derives conditions for finite-difference approximations to preserve statistical benefits.

This paper uses DRL for long-short portfolio optimization, improving risk-adjusted returns.

problem Traditional portfolio optimization limits diversification by excluding short-selling.
method Developed a DRL framework with a short-selling mechanism for continuous trading.
result DRL model with short-selling achieves superior risk-adjusted returns.

A new KDE model prevents singular solutions and accelerates optimization for probabilistic modeling.

problem Adapting to varying densities in data regions for probabilistic modeling.
method Adaptive KDE model with individual bandwidths, LOO-MLL criterion, and modified EM algorithm.
result The proposed models prevent singular solutions and have promising performance.

TINs use neural networks to interpret technical indicators for trading.

problem Lack of interpretable neural architectures for technical indicators in trading.
method Introduced TINs, a neural architecture that reformulates technical indicators into trainable modules.
result Improved risk-adjusted performance compared to traditional indicator-based strategies.

The paper addresses frequentist regret of Linear Thompson Sampling in stochastic linear bandits.

problem The frequentist regret of Linear Thompson Sampling (LinTS) is worse than its Bayesian counterpart.
method The paper proves the fundamental nature of the frequentist regret bound for LinTS and proposes a data-driven version of LinTS to achieve minimax optimal frequentist regret.
result The frequentist regret bound for LinTS is O~(ddT)\widetilde{\mathcal{O}}(d\sqrt{dT}), which is the best possible under certain conditions.

Study uses RL to optimize credit card limits, achieving better results than traditional methods.

problem Optimizing credit card limit adjustments in banking.
method Reinforcement learning with offline learning strategy.
result Double Q-learning agent outperforms other strategies in generating optimal policy.

This paper presents a discrete-time option pricing model that is rooted in Reinforcement Learning (RL), and more specifically in the famous Q-Learning method of RL. We construct a risk-adjusted Markov Decision Process for a discrete-time version of the classical Black-Scholes-Merton (BSM) model, where the option price …

2017-12-13abs ↗pdf ↗

Confounding bias, missing data, and selection bias are three common obstacles to valid causal inference in the data sciences. Covariate adjustment is the most pervasive technique for recovering casual effects from confounding bias. In this paper, we introduce a covariate adjustment formulation for controlling confoundi…

2019-07-02abs ↗pdf ↗

The paper reviews historical and modern approaches to asset pricing probability measures.

problem Constructing or selecting probability measures for asset pricing.
method Historical review of various approaches including state price theory, martingale measures, and modern data-driven methods.
result Modern asset pricing involves constructing, transforming, or selecting probability measures to represent market prices.

Investigates adjustments on Lie group crossed modules for gauge theory.

problem Existence and classification of adjustments on crossed modules of Lie groups.
method Differentiation/integration correspondence with infinitesimal adjustments; Lie algebra techniques.
result Infinitesimal adjustments exist if and only if the Kassel-Loday class lies in the image of the Chern-Weil homomorphism.

We describe principal 3-bundles with adjusted connections using Lie algebras and groupoids.

problem Describing principal 3-bundles with adjusted connections.
method Derived explicit forms of adjustment data for 3-term LL_\infty-algebras, integrated action Lie 3-algebroids to Lie 3-groupoids, and used differential cohomology.
result Explicit description of principal 3-bundles with adjusted connections in terms of differential cohomology.

Efficient adjustment sets found for cost-minimized causal estimations.

problem Estimating interventional means with minimum cost in causal graphical models.
method Defined cost-adjustment sets, constructed flow networks, and used maximum flow algorithms.
result Minimum cost optimal adjustment sets exist and can be found efficiently.

The paper provides PAC bounds for estimating causal effects using covariate adjustment with a valid set.

problem Estimating causal effects in high-dimensional settings without randomized experiments.
method PAC learning perspective, valid adjustment set, $\eps$-Markov blanket, constraint-based algorithms.
result PAC-bounds the estimation error of covariate adjustment by a term exponential in the size of the adjustment set.

Study optimal adjustment sets for causal policies with hidden variables.

problem Estimating dynamic treatment regimes with hidden variables.
method Developed criteria for graphs without hidden variables to compare estimators, extended to dynamic policies and hidden variables.
result Existence and computation of optimal minimal and globally optimal adjustment sets.

Improved ARMA-GARCH model for illiquid assets like cryptocurrencies.

problem Inadequate modeling of illiquid assets, especially cryptocurrencies, with traditional ARMA-GARCH models.
method Introducing liquidity-adjusted liquidity jump and diffusion metrics into ARMA-GARCH framework.
result The liquidity-adjusted model improves model fit and volatility sensitivity for cryptocurrencies.

New method estimates treatment effects from high dimensional data.

problem Estimating treatment effects from high dimensional data with confounders.
method Generative modeling approach to backdoor adjustment in variational inference.
result Empirically, estimates interventional likelihood in high dimensional settings.