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

129258387516 · Jun 202019922001200920172026
48 results for multiple rates

Paper proves multiplicative weight updates can train neural networks without learning rate tuning.

problem Vanishing and exploding gradients in gradient descent for compositional functions.
method Proves descent lemma for compositional functions using multiplicative weight updates and derives Madam optimizer.
result Madam optimizer trains state-of-the-art neural networks without learning rate tuning.

The paper develops a new formula for financial pricing under multiple interest rates and collateralization.

problem Financial pricing under multiple interest rates and collateralization.
method Derives a change of measure formula for recursive conditional expectations in a jump-diffusion setting.
result Generalizes the change of numéraire technique for multiple interest rates and collateralization.

We provide a general and tractable framework under which all multiple yield curve modeling approaches based on affine processes, be it short rate, Libor market, or HJM modeling, can be consolidated. We model a numeraire process and multiplicative spreads between Libor rates and simply compounded OIS rates as functions …

2016-03-02abs ↗pdf ↗

We address the problem of non-parametric multiple model comparison: given ll candidate models, decide whether each candidate is as good as the best one(s) or worse than it. We propose two statistical tests, each controlling a different notion of decision errors. The first test, building on the post selection inference…

2019-10-27abs ↗pdf ↗

We propose a general framework for modeling multiple yield curves which have emerged after the last financial crisis. In a general semimartingale setting, we provide an HJM approach to model the term structure of multiplicative spreads between FRA rates and simply compounded OIS risk-free forward rates. We derive an HJ…

2014-06-17abs ↗pdf ↗

Estimates target GGM using auxiliary studies with false discovery rate control.

problem Estimating high-dimensional GGMs from related studies.
method Transfer learning with Trans-CLIME and debiased Trans-CLIME estimators.
result Debiased Trans-CLIME estimator provides element-wise asymptotic normality and false discovery rate control.

Near-optimal rates for multi-task learning with shared representations.

problem Approximation and statistical complexity of learning multiple operators.
method Multiple Neural Operators (MNO) architecture and comparison with DeepONet.
result Near-optimal upper and lower bounds for approximation and generalization.

We first show that there are in fact triangular arbitrage opportunities in the spot foreign exchange markets, analyzing the time dependence of the yen-dollar rate, the dollar-euro rate and the yen-euro rate. Next, we propose a model of foreign exchange rates with an interaction. The model includes effects of triangular…

2002-02-22abs ↗pdf ↗

Study learns dynamics of linear systems from multiple short trajectories.

problem Learning dynamics of autonomous linear systems from multiple short trajectories.
method Finite sample analysis for stable and unstable systems, adjusting trajectory length for marginally stable systems.
result Learning rate of O(1N)\mathcal{O}(\frac{1}{\sqrt{N}}) for both stable and unstable systems.

Kolmogorov-Arnold Networks achieve optimal convergence rates in nonparametric regression.

problem Nonparametric function approximation in multivariate settings.
method Structured additive and multiplicative KANs using B-splines.
result Achieve minimax-optimal convergence rate O(n2r/(2r+1))O(n^{-2r/(2r+1)}) for Sobolev space functions.

Max-rank improves multiple testing in conformal prediction.

problem Simultaneous testing of multiple hypotheses in scientific inquiries.
method Introduces max-rank, a novel correction for positive dependencies in simultaneous testing.
result Max-rank efficiently controls family-wise error rate and improves predictive uncertainty estimates.

A dynamic agent model is introduced with an annual random wealth multiplicative process followed by taxes paid according to a linear wealth-dependent tax rate. If poor agents pay higher tax rates than rich agents, eventually all wealth becomes concentrated in the hands of a single agent. By contrast, if poor agents are…

2017-11-15abs ↗pdf ↗

DeepFDR uses deep learning for better FDR control in neuroimaging data.

problem Spatial dependence among voxel-based tests in neuroimaging data.
method DeepFDR leverages unsupervised deep learning-based image segmentation.
result DeepFDR outperforms existing methods in FDR control and computational efficiency.

In this work, we study the problem of learning a single model for multiple domains. Unlike the conventional machine learning scenario where each domain can have the corresponding model, multiple domains (i.e., applications/users) may share the same machine learning model due to maintenance loads in cloud computing serv…

2018-05-19abs ↗pdf ↗

Unified framework controls false discovery rate in bandit multiple testing.

problem Designing adaptive algorithms to identify true discoveries in multiple hypothesis testing.
method Unified modular framework using e-processes for FDR control in arbitrary settings.
result Unified framework ensures FDR control for dependent and simultaneous arm queries.

The paper extends kernel ridge regression to product kernels and reveals new convergence behaviors.

problem Understanding kernel ridge regression in large dimensions with various kernels.
method Established a broad family of large dimensional kernels and derived convergence rates.
result Revealed new phenomena including minimax optimality, saturation effect, and multiple descent behavior.

New algorithm optimizes beam and rate allocation in mmWave systems for multiple users.

problem Optimizing beam and rate allocation in mmWave systems for multiple users with limited feedback.
method Introducing SAT-CTS, a combinatorial semi-bandit policy with satisficing objective.
result SAT-CTS achieves finite-time regret bounds and reduces satisficing regret in mmWave systems.

Private online FDR control for adaptive testing under differential privacy.

problem Controlling false discoveries in adaptive multiple hypothesis testing with privacy constraints.
method Private online algorithms based on non-private results, ensuring privacy and statistical performance.
result Strong guarantees for privacy and statistical performance in FDR and power.

In this paper, we give a new sharp generalization bound of lp-MKL which is a generalized framework of multiple kernel learning (MKL) and imposes lp-mixed-norm regularization instead of l1-mixed-norm regularization. We utilize localization techniques to obtain the sharp learning rate. The bound is characterized by the d…

2011-03-27abs ↗pdf ↗

A new algorithm tackles bilevel optimization with multiple inner minima.

problem Challenges in bilevel optimization with multiple inner minima.
method Reformulated as constrained optimization, solved via primal-dual bilevel optimization (PDBO) algorithm.
result First non-asymptotic convergence guarantee for bilevel optimization with multiple inner minima.

Jointly models cause-of-death mortality rates across multiple countries and genders.

problem Modeling cause-of-death mortality rates in a multinational setting.
method Multi-Output Gaussian Processes (MOGP) with Kronecker-structured kernels and latent factors.
result Efficiently captures heterogeneity and dependence across different factor inputs.

Neural networks solve SPDEs using Wiener chaos expansion.

problem Solving stochastic partial differential equations (SPDEs) numerically.
method Using neural networks in the truncated Wiener chaos expansion.
result Approximation rates for learning SPDE solutions with noise.

We analyze an N+1N+1-player game and the corresponding mean field game with state space {0,1}\{0,1\}. The transition rate of jj-th player is the sum of his control αjα^j plus a minimum jumping rate ηη. Instead of working under monotonicity conditions, here we consider an anti-monotone running cost. We show that the mean …

2019-08-16abs ↗pdf ↗

We develop methods to estimate lag and parameters for multiple stable autoregressive processes.

problem Estimating lag and parameters for multiple stable autoregressive processes with unknown lag.
method Use convex programming to simultaneously select lag and estimate parameters across multiple processes.
result The estimated process is stable, and forecasting errors can outperform known rates.