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.

169,051 papers · 148 categories

Trend · papers per month

3.5%7.0%10.5%14.0% · May 202619922001200920182026
48 results for Invocation Rate

Paper proposes MCMA architecture for neural approximate computing with higher invocation rate and energy savings.

problem Limited invocation rate of neural approximators leading to suboptimal energy efficiency.
method Introduces MCMA architecture with a multiclass classifier and multiple approximators, sharing hardware resources and efficiently swapping approximators.
result Significantly higher invocation rate and energy savings compared to existing methods.

Improved security of smart contracts by classifying them into four categories.

problem Detecting and classifying vulnerabilities in smart contracts efficiently.
method Used AWD-LSTM for multi-class classification, addressing class imbalance.
result Achieved a weighted average Fbeta score of 90.0%.

We study the moduli spaces of polygons in R^2 and R^3, identifying them with subquotients of 2-Grassmannians using a symplectic version of the Gel'fand-MacPherson correspondence. We show that the bending flows defined by Kapovich-Millson arise as a reduction of the Gel'fand-Cetlin system on the Grassmannian, and with t…

1996-02-29abs ↗pdf ↗

Efficiently estimates quantiles and maximum in unbounded datasets with differential privacy.

problem Efficiently estimating quantiles and maximum in unbounded datasets with differential privacy.
method Simple invocation of a subroutine called AboveThreshold, iteratively called in Sparse Vector Technique.
result Improved estimates on highest quantiles with robustness and accuracy.

We take a new look at parameter estimation for Gaussian Mixture Models (GMMs). In particular, we propose using \emph{Riemannian manifold optimization} as a powerful counterpart to Expectation Maximization (EM). An out-of-the-box invocation of manifold optimization, however, fails spectacularly: it converges to the same…

2015-06-25abs ↗pdf ↗

AGENTICAITA uses AI agents to autonomously trade markets without human intervention.

problem Inability of traditional trading systems to adapt to market complexity.
method Introduces an agentic AI framework with specialized LLM agents reasoning, negotiating, and acting.
result Demonstrated operational correctness and non-trivial inter-agent negotiation in live market conditions.

In this paper, we study the general problem of optimizing a convex function F(L)F(L) over the set of p×pp \times p matrices, subject to rank constraints on LL. However, existing first-order methods for solving such problems either are too slow to converge, or require multiple invocations of singular value decompositions.…

2017-12-08abs ↗pdf ↗

There is increasing interest in learning algorithms that involve interaction between human and machine. Comparison-based queries are among the most natural ways to get feedback from humans. A challenge in designing comparison-based interactive learning algorithms is coping with noisy answers. The most common fix is to …

2018-02-20abs ↗pdf ↗

Overrides of credit ratings are important correctives of ratings that are determined by statistical rating models. Financial institutions and banking regulators agree on this because on the one hand errors with ratings of corporates or banks can have fatal consequences for the lending institutions and on the other hand…

2012-03-10abs ↗pdf ↗

The paper analyzes how learning rate affects SGD and provides insights into optimal rates.

problem Understanding the impact of learning rate on stochastic gradient descent.
method Developed a learning-rate-dependent stochastic differential equation (lr-dependent SDE) to analyze SGD.
result Established a linear rate of convergence for SGD and found the optimal linear rate by analyzing the spectrum of the Witten-Laplacian.

The paper explores using set-level ratings for better user-item preference prediction in recommender systems.

problem Capturing user preferences on individual items using set-level ratings.
method Developed collaborative filtering-based methods to model user behaviors in set-level ratings.
result Collaborative filtering-based models can recover and predict user preferences on individual items using set-level ratings.

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 ↗

A novel approach models rating transitions using Lie groups and Deep Learning.

problem Modeling rating transitions with geometric properties and stochastic processes.
method Introducing Itô-SDEs on Lie groups, using TimeGAN for calibration, and examining rating matrix properties.
result The geometric approach using Lie groups and Deep Learning generates a good fit for rating transitions.

Paper examines pricing and hedging for cross-currency swaps referencing backward-looking rates.

problem Pricing and hedging cross-currency swaps with backward-looking rates.
method Uses interest rate and currency futures for hedging, analyzes arbitrage-free multi-curve setting.
result Explicit pricing and hedging results for CCBS with backward-looking rates.

Method calibrates local volatility and stochastic short rate models for equity-rate dynamics.

problem Joint calibration of local volatility and stochastic short rate models.
method Iterative approach using semimartingale optimal transport.
result Demonstrated performance on market data using European SPX options and cap interest rate options.

This paper analyzes the robust growth rate of leveraged ETFs under uncertain parameters.

problem Analyzing the robust long-term growth rate of leveraged ETFs with uncertain parameters.
method Derive worst-case parameters using comparison principle and martingale extraction method.
result Explicitly obtain robust long-term growth rates under various models.

Large initial learning rate helps neural nets generalize better.

problem Understanding why large initial learning rates lead to better neural net generalization.
method Developed a proof for a two-layer network and demonstrated with experiments on CIFAR-10.
result Proved that a two-layer network trained with a large initial learning rate and annealing generalizes better than one trained with a small learning rate.

Abstract Coxeter groups have growth rates that are Perron numbers.

problem Understanding growth rates of Coxeter groups.
method Defined a class of Coxeter groups, \infty--spanned, and analyzed their growth rates.
result For \infty--spanned Coxeter groups, geodesic growth rate strictly dominates word growth rate and appears to be a Perron number.

Paper finds funding rates on BitMEX predict Bitcoin inverse swap contracts.

problem Understanding the relationship between BitMEX funding rates and Bitcoin derivatives.
method Examined Heteroskedasticity of funding rates, established Granger causality, developed GARCH models for prediction.
result Funding rates on BitMEX predict Bitcoin inverse swap contracts.

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 ↗

We construct a no-arbitrage model of bond prices where the long bond is used as a numeraire. We develop bond prices and their dynamics without developing any model for the spot rate or forward rates. The model is arbitrage free and all nominal interest rates remain positive in the model. We give examples where our mode…

2006-12-01abs ↗pdf ↗

This paper shows how forward rate interpolations are equivalent to discount factor interpolations in yield curve construction.

problem The challenge of choosing between different interpolation methods for yield curve construction.
method Demonstrates the equivalence between forward rate interpolations and discount factor interpolations.
result Some popular interpolation methods on forward rates are equivalent to classical interpolation methods on discount factors.

Rate-In dynamically adjusts dropout rates during inference to improve uncertainty estimation in neural networks.

problem Static dropout rates lead to suboptimal uncertainty estimates in neural networks.
method Rate-In dynamically adjusts dropout rates using information-theoretic principles.
result Rate-In improves calibration and sharpens uncertainty estimates compared to fixed or heuristic dropout rates.

Clarifies interest rate cap rules for loans with unconventional cash flows.

problem Ambiguity in applying interest rate caps to loans with non-conventional internal rate of return (IRR).
method Clarified conventional IRR definition, axiomatized, and extended to all loans.
result Unique extension of interest rate cap rule for all loans, based on net present value test.

The study analyzes historical interest rates to predict future discount rates and their implications on climate change.

problem Predicting future discount rates to inform climate change mitigation policies.
method Constructed real interest rates using historical data and a stochastic model (Ornstein-Uhlenbeck).
result Only 4 out of 14 countries have positive long-run discount rates, suggesting urgent action on climate change.

Developed unbiased estimators for Heston model with stochastic interest rates.

problem Estimating the Heston model with stochastic interest rates.
method Combined unbiased estimators with the Heston model and developed a semi-exact log-Euler scheme.
result Convergence rate of O(h)O(h) in the L2L^2 norm for a wide range of models.