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

80159239318 · Jun 202019922001200920172026
48 results for FD property

Groups of importance in group theory have flexible stability properties.

problem Stability and flexibility of groups in geometric and combinatorial group theory.
method Establishing Kirchberg's Local Lifting Property and Lubotzky--Shalom's Property FD for specific groups.
result Groups like 33-manifold groups, limit groups, and certain one-relator groups are very flexibly stable.

Debiased learners estimate heterogeneous treatment effects in observational studies.

problem Estimating heterogeneous treatment effects in observational studies with unmeasured confounders.
method Debiased Front-Door (FD) learners, FD-DR-Learner and FD-R-Learner, under specific assumptions.
result Debiased learners satisfy error bounds and stage-error decompositions, delivering reliable HTE estimates.

A new method for pricing options with stochastic volatility and jumps.

problem Pricing options under stochastic volatility and jumps.
method Fourth-order compact finite-difference scheme with implicit-explicit Crank-Nicolson framework.
result The method achieves near-fourth-order spatial accuracy and up to two orders of magnitude lower runtime than quadratic finite elements.

Linear classification has been widely used in many high-dimensional applications like text classification. To perform linear classification for large-scale tasks, we often need to design distributed learning methods on a cluster of multiple machines. In this paper, we propose a new distributed learning method, called f…

2018-02-10abs ↗pdf ↗

Improved ridge regression with Frequent Directions for large-scale tasks.

problem Improving performance of ridge regression for large-scale data.
method Combines Frequent Directions with iterative optimization schemes.
result Achieves high accuracy in estimating bias and variance for sketched ridge regression.

Enhanced DFO using adaptive batch-based FD estimates.

problem Derivative-free optimization with imprecise gradient estimates.
method Adaptive batch-based finite difference estimation and dynamic sampling strategy.
result Algorithm achieves convergence rate similar to KW and SPSA methods.

New learning-based methods improve spectral efficiency in mmWave full-duplex systems.

problem Residual self-interference and high pathloss in mmWave full-duplex systems.
method Proposed two learning schemes (ELM-HBF and CNN-HBF) using ADMM and MM algorithms for SI cancellation and joint HBF optimization.
result Learning-based schemes achieve at least 22.1% higher spectral efficiency and faster online prediction and training times.

Since the debut of Evolution Strategies (ES) as a tool for Reinforcement Learning by Salimans et al. 2017, there has been interest in determining the exact relationship between the Evolution Strategies gradient and the gradient of a similar class of algorithms, Finite Differences (FD).(Zhang et al. 2017, Lehman et al. …

2019-12-27abs ↗pdf ↗

Paper applies subdiffusive dynamics to American and barrier options pricing.

problem Valuation of American and barrier options in subdiffusive financial models.
method Proposes weighted finite difference and Longstaff-Schwartz methods for valuation.
result Numerical valuation of American and barrier options demonstrated.

The purpose of this note is to attract attention to the following conjecture (metastable rr-fold Whitney trick) by clarifying its status as not having a complete proof, in the sense described in the paper. Assume that D=D1DrD=D_1\sqcup\ldots\sqcup D_r is disjoint union of rr disks of dimension ss, f:DBdf:D\to B^d a proper …

2017-02-14abs ↗pdf ↗

Efficiently approximates higher-order derivatives for generative models.

problem Expensive computation of higher-order derivatives in generative models.
method Rewrite SM objective in terms of directional derivatives and use finite difference for efficient approximation.
result Comparable results to gradient-based methods but significantly more computationally efficient.

Finite rank median spaces are a simultaneous generalisation of finite dimensional CAT(0){\rm CAT}(0) cube complexes and real trees. If ΓΓ is an irreducible lattice in a product of rank one simple Lie groups, we show that every action of ΓΓ on a complete, finite rank median space has a global fixed point. This is in sharp…

2017-11-21abs ↗pdf ↗

A new FFT-based method simplifies causal structure recovery for linear dynamical systems.

problem Efficiently identifying dynamic causal effects from time-series data.
method FFT-based approach to reduce computational complexity to O(Tn3logN)O(Tn^3 \log N).
result Significant computational advantage for graph reconstruction.

Sketchy reduces memory and compute requirements for adaptive regularization in deep learning.

problem Prohibitive memory and running time for adaptive regularization methods in deep learning.
method Low-rank sketching approach using Frequent Directions (FD) to reduce memory and compute requirements.
result Efficient interpolation between resource requirements and degradation in regret guarantees with rank kk.

Paper presents a fast and adaptive filter for SI suppression in full-duplex transceivers.

problem Self-interference suppression in full-duplex transceivers with nonlinearity.
method Adaptive projected subgradient method (APSM) in a reproducing kernel Hilbert space (RKHS).
result The proposed method achieves favorable digital SIC performance compared to benchmarks.

QMC and GSA improve option pricing and risk measures efficiency.

problem Efficiently pricing and hedging complex financial instruments.
method Application of QMC and GSA techniques for financial instrument pricing and hedging, comparing MC vs QMC and analyzing greeks computation.
result QMC outperforms MC in most cases, especially in high-dimensional simulations, leading to faster and more stable convergence.

VFDS selects dynamic features for efficient HAR tasks, optimizing performance-cost trade-offs.

problem Optimizing feature selection for varying costs and dynamic contexts in machine learning tasks.
method Bayesian learning framework with variational dynamic selection policy.
result VFDS selects different features under changing contexts, saving sensory costs while maintaining HAR accuracy.

In many applications we seek to maximize an expectation with respect to a distribution over discrete variables. Estimating gradients of such objectives with respect to the distribution parameters is a challenging problem. We analyze existing solutions including finite-difference (FD) estimators and continuous relaxatio…

2018-09-29abs ↗pdf ↗

SFG improves on-manifold sampling without labels or additional training.

problem Guiding score-based models on manifolds without labeled data or extra training.
method Developed saddle-free guidance (SFG) that uses curvature of log density estimates.
result SFG achieves state-of-the-art metrics in image generation without labeled data or additional training.

Asynchronous event sequences are the basis of many applications throughout different industries. In this work, we tackle the task of predicting the next event (given a history), and how this prediction changes with the passage of time. Since at some time points (e.g. predictions far into the future) we might not be abl…

2019-11-13abs ↗pdf ↗

Continuous semi-implicit models enable faster training and better performance in generative modeling.

problem Slow convergence in hierarchical semi-implicit models during training.
method CoSIM, a continuous semi-implicit model that incorporates a continuous transition kernel for efficient training.
result CoSIM achieves superior performance on image generation tasks compared to existing methods.

New methods solve complex optimization problems in machine learning.

problem Challenges in stochastic bilevel optimization with constraints and high variables.
method Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems.
result Comprehensive convergence theory for both unconstrained and constrained cases.

Score matching fails to train VAEs robustly, revealing autoencoding loss insights.

problem Catastrophic failure of variational score matching on VAE models.
method Analysis of existing variational score matching objectives and their equivalence to autoencoding losses.
result Score matching methods fail to produce robust VAE models, predicting poor performance.

A hybrid ML method improves ship response predictions across different sea conditions.

problem Improving accuracy and generalizability of ML methods for ship response predictions.
method A hybrid machine learning method that corrects forces in a low-fidelity equation of motion.
result The hybrid method offers improved prediction accuracy and generalizability compared to benchmarks.

Study tests UK FTSE-listed companies' financial data for Benford's Law conformity.

problem Ensuring the fairness of public revenue collection and reducing tax avoidance risks.
method Utilised pre-tax income and total assets data from 567 FTSE companies, tested for Benford's Laws conformity using χ2\chi^2 and MAD tests.
result MAD test rejects Benford's Laws conformity, suggesting potential issues with reported financial data.

We prove recognition theorems for codimension one manifold factors of dimension n4n \geq 4. In particular, we formalize topographical methods and introduce three ribbons properties: the crinkled ribbons property, the twisted crinkled ribbons property, and the fuzzy ribbons property. We show that X×RX \times \mathbb{R} i…

2009-09-17abs ↗pdf ↗

The study shows that several properties are not profinite invariants.

problem Determining which properties are profinite invariants.
method Combining Rips constructions and iterated group-theoretic Dehn filling on hyperbolic virtually special groups.
result Several properties (stable commutator length, quasimorphisms, property NL, property FW_\infty, property FA, and non-abelian free subgroups) are not profinite invariants.