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

Trend · papers per month

53107160213 · Jun 202019922001200920172026
48 results for range decreasing

Characterizes a general range decreasing group homomorphism.

problem Understanding range decreasing group homomorphisms in the entire mapping group.
method Characterization of a general range decreasing group homomorphism.
result Computes a particular class of homomorphisms and identifies all range decreasing group homomorphisms on specific mapping groups.

New conditions for weighted composition operators in group homomorphisms.

problem Conditions for weighted composition operators in group homomorphisms.
method Range decreasing group homomorphisms.
result New insights into weighted composition operators and their algebraic structure.

This paper looks into the analysis of the long-range auto-correlations and cross-correlations in bond market. Based on Detrended Moving Average (DMA) method, empirical results present a clear evidence of long-range persistence that exists in one year scale. The degree of long-range correlation related to maturities has…

2016-10-31abs ↗pdf ↗

The problem of recovering the asymptotics of a short range perturbation of the Euclidean metric on R^n from fixed energy scattering data is studied. It is shown that if two such metrics, g1, g2, have scattering data at some fixed energy which are equal up to smoothing, then there exists a diffeomorphism ψ`fixing infini…

1997-10-31abs ↗pdf ↗

New neural network models extreme value distributions with preserved shape constraints.

problem Modeling multivariate extreme value distributions with preserved shape constraints.
method d-max-decreasing neural network architecture for non-parametric calibration and generation of MEVs.
result The proposed architecture approximates the dependence structure of MEVs at parametric rate and preserves essential shape constraints.

The Gibbs algorithm's generalization error is bounded, improving with prior volume in low temperatures.

problem Bounding the generalization error of the Gibbs algorithm in low temperature regimes.
method Analyzes the Gibbs algorithm's performance, extending known high-temperature bounds to low-temperature scenarios.
result With high probability, the generalization error decreases with the total prior volume of similar hypotheses.

Introduces CHL, a new loss function for continuous similarity learning.

problem Binary similarity learning limitations.
method CHL is a novel loss function that generalizes histogram loss to continuous similarities.
result CHL solves a wider range of tasks including similarity learning, representation learning, and data visualization.

This research examines how the error rate of nearest neighbor classifiers varies with dataset size.

problem The scaling of classification error rates with dataset size is not uniform.
method Theoretical analysis of nearest neighbor classifiers, focusing on early and late phases of dataset size.
result The error rate of nearest neighbor classifiers can have fine-grained rates depending on the dataset size and data distribution.

We study sharp asymptotics of the first eigenvalue on Riemannian surfaces obtained from a fixed Riemannian surface by attaching a collapsing flat handle or cross cap to it. Through a careful choice of parameters this construction can be used to strictly increase the first eigenvalue normalized by area if the initial su…

2019-09-06abs ↗pdf ↗

Paper optimizes liquidity provision in decentralized finance markets.

problem Strategic LPs face predictable losses and concentration risk in CL pools.
method Derive optimal liquidity provision strategy based on fees, PL, and concentration risk.
result Optimal strategy increases fee revenue and profit from marginal rate changes.

Investment decisions shift earlier as patience decreases, with implications for pasting conditions.

problem Investment timing under decreasing impatience.
method Game-theoretic framework with continuous-time capacity expansion problem.
result Decreasing impatience leads to earlier investment decisions, but can violate smooth pasting conditions.

The paper explains why estimating a history-dependent policy can reduce MSE in reinforcement learning.

problem Understanding why history-dependent policies can improve MSE in off-policy evaluation.
method The paper derives a bias-variance decomposition of MSE for various OPE estimators, showing how history-dependent policies can decrease variance and increase bias.
result History-dependent policies can decrease the variance of importance sampling estimators, leading to lower MSE.

D2SRM solves complex PDEs using deep learning.

problem High-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.
method Single scalar space-time network generating derivative-consistent approximations trained through residuals and penalties.
result Well-posedness and convergence theory established for globally Lipschitz equations.

Improved model accuracy can reduce overall user accuracy in competitive markets.

problem The impact of model competition on overall user accuracy.
method Defined a model of competition for classification tasks and used data representations to study the effect of scale.
result Improving data representation quality can decrease overall predictive accuracy across users (social welfare) in a competitive market.

This econophysics work studies the long-range Ising model of a finite system with NN spins and the exchange interaction JN\frac{J}{N} and the external field HH as a modely for homogeneous credit portfolio of assets with default probability PdP_{d} and default correlation ρdρ_{d}. Based on the discussion on the $(J,H)…

2006-03-06abs ↗pdf ↗

We investigate the waiting-time distribution of the absolute return in the Korean stock-market index KOSPI. We define the waiting time as a time interval during which the normalized absolute return remains continuously below a threshold rcr_c. Through an exponential bin plot, we observe that the waiting-time distributi…

2005-08-30abs ↗pdf ↗

Matrix Product States (MPS), also known as Tensor Train (TT) decomposition in mathematics, has been proposed originally for describing an (especially one-dimensional) quantum system, and recently has found applications in various applications such as compressing high-dimensional data, supervised kernel linear classifie…

2018-12-13abs ↗pdf ↗

The influence of the past price behaviour on the realized volatility is investigated in the present article. The results show that trending (drifting) prices lead to increased (decreased) realized volatility. This ``volatility induced by trend'' constitutes a new stylized fact. The past price behaviour is measured by a…

2005-01-28abs ↗pdf ↗

Numerical observations on martingale couplings are confirmed under certain conditions.

problem Understanding the validity of numerical observations on maximizers and minimizers of martingale couplings.
method Investigation of sufficient conditions and counterexamples for the property to hold.
result The non-decreasing property of martingale couplings is preserved for maximizers under specific conditions.

We present an intriguing discovery related to Random Fourier Features: in Gaussian kernel approximation, replacing the random Gaussian matrix by a properly scaled random orthogonal matrix significantly decreases kernel approximation error. We call this technique Orthogonal Random Features (ORF), and provide theoretical…

2016-10-28abs ↗pdf ↗

DRAG decreases regularization to accelerate semi-discrete OT convergence.

problem Mitigating bias in semi-discrete OT problems with entropic regularization.
method DRAG: Decreasing Regularization Averaged Gradient, a stochastic gradient descent algorithm.
result DRAG achieves unbiased O(1/t)\mathcal{O}(1/t) sample and iteration complexity for OT cost and potential estimation, and O(1/t)\mathcal{O}(1/\sqrt{t}) rate for OT map.

We discuss a special class of solutions to the minimal surface system. These are vector-valued functions that "decrease area" and are natural generalization of scalar functions. After defining area-decreasing maps, we show several classical results for the minimal surface equation can be generalized. We also conjecture…

2003-03-04abs ↗pdf ↗

Fairness constraints can improve accuracy from biased data.

problem Learning from biased training data can produce biased and suboptimal classifiers.
method Examined fairness-constrained ERM and other recovery methods.
result Equal Opportunity fairness constraint combined with ERM provably recovers Bayes Optimal Classifier under various bias models.

Ensembles, as a widely used and effective technique in the machine learning community, succeed within a key element -- "diversity." The relationship between diversity and generalization, unfortunately, is not entirely understood and remains an open research issue. To reveal the effect of diversity on the generalization…

2019-10-30abs ↗pdf ↗

The capacity of meta-learning algorithms to quickly adapt to a variety of tasks, including ones they did not experience during meta-training, has been a key factor in the recent success of these methods on few-shot learning problems. This particular advantage of using meta-learning over standard supervised or reinforce…

2018-12-05abs ↗pdf ↗

The paper provides a theoretical justification for using stable SSM blocks in deep sequential models.

problem Developing generalization bounds for deep sequential models with varying sequence lengths.
method Using Rademacher contraction and stability constraints, the paper derives a PAC bound that is independent of sequence length.
result The derived PAC bound decreases as the stability of SSM blocks increases, providing theoretical justification for their use.

Deep learning outperforms Black-Scholes in Brazilian Petrobras option pricing.

problem Improving option pricing accuracy for Petrobras stocks.
method Trained deep residual networks using a custom loss function with historical data.
result Deep learning achieved a 64.3% reduction in mean absolute error compared to Black-Scholes.