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

Trend · papers per month

66131197262 · Jun 202019922001200920172026
48 results for misclustering rate

Randomized spectral co-clustering speeds up large-scale directed networks.

problem Co-clustering directed networks efficiently for large-scale data.
method Randomized spectral co-clustering algorithms using random-projection and random-sampling techniques.
result Theoretical and numerical validation of approximation and misclustering error rates.

New method clusters high-dimensional data with anisotropic noise.

problem Clustering high-dimensional anisotropic mixtures with varying noise structures.
method Covariance Projected Spectral Clustering (COPO) method that projects data onto a low-dimensional space and reassigns clusters based on estimated covariances.
result COPO achieves minimax-optimal misclustering rates in Gaussian settings.

Clustering algorithms are used in a large number of applications and play an important role in modern machine learning-- yet, adversarial attacks on clustering algorithms seem to be broadly overlooked unlike supervised learning. In this paper, we seek to bridge this gap by proposing a black-box adversarial attack for c…

2019-11-16abs ↗pdf ↗

Networks or graphs can easily represent a diverse set of data sources that are characterized by interacting units or actors. Social networks, representing people who communicate with each other, are one example. Communities or clusters of highly connected actors form an essential feature in the structure of several emp…

2010-07-09abs ↗pdf ↗

Classical clustering algorithms typically either lack an underlying probability framework to make them predictive or focus on parameter estimation rather than defining and minimizing a notion of error. Recent work addresses these issues by developing a probabilistic framework based on the theory of random labeled point…

2018-06-02abs ↗pdf ↗

New model for clustering dependent community Hawkes processes in temporal networks.

problem Modeling strong dependence and community structure in temporal networks.
method Dependent Community Hawkes (DCH) models combining stochastic block models and Hawkes processes.
result Spectral clustering error bound derived for DCH models.

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.

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.

Most of the existing recommender systems use the ratings provided by users on individual items. An additional source of preference information is to use the ratings that users provide on sets of items. The advantages of using preferences on sets are two-fold. First, a rating provided on a set conveys some preference in…

2019-04-22abs ↗pdf ↗

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.

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.

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.

Rate GENERIC extends thermodynamics principles to non-equilibrium systems.

problem Understanding non-equilibrium thermodynamics and its relation to equilibrium thermodynamics.
method Developed a geometrical framework for rate GENERIC, extending Onsager's variational principle.
result Rate GENERIC structure provides a new perspective on thermodynamics in non-equilibrium systems.

This work models overnight rates with jumps and discontinuities, extending classical short-rate models.

problem Capturing the jump behavior and discontinuities in overnight rates for accurate modeling.
method Developed a term structure modeling framework based on overnight rates, accommodating stochastic discontinuities.
result Simple specifications can capture the jump behavior of overnight rates, and explicit valuation formulas are provided.

GALA adapts learning rates online by aligning gradients, improving deep learning model performance.

problem Fine-tuning learning rates for deep learning models requires extensive grid search.
method GALA dynamically adjusts learning rates by tracking gradient alignment and local curvature.
result GALA produces a flexible, adaptive learning rate schedule that increases when gradients align.

Paper studies Gaussian approximation in linear regression with rates derived.

problem Gaussian approximation in online linear regression.
method Derives rates for constant learning rate settings, analyzes dependence on dd and design matrix.
result Rate of normal approximation is logn/n\sqrt{\log{n}/n} for large nn.