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.
Defines a new short rate model and convexity adjustment formulae.
Develops a method to approximate convexity adjustments for interest rate products.
This article presents valuation of Treasury Bonds (T-Bonds) on Macedonian Stock Exchange (MSE) and empirical test of duration, modified duration and convexity of the T-bonds at MSE in order to determine sensitivity of bonds prices on interest rate changes. The main goal of this study is to determine how standard valuat…
We analyze the classical model of compound interest with a constant per-period payment and interest rate. We examine the outstanding balance function as well as the periodic payment function and show that the outstanding balance function is not generally concave in the interest rate, but instead may be initially convex…
By adopting the polynomial interpolation method, we propose an approach to hedge against the interest-rate risk of the default-free bonds by measuring the nonparallel movement of the yield-curve, such as the translation, the rotation and the twist. The empirical analysis shows that our hedging strategies are comparable…
Study exact minimax rates for density estimation over convex classes, extending previous work.
A lot of effort has been invested into characterizing the convergence rates of gradient based algorithms for non-linear convex optimization. Recently, motivated by large datasets and problems in machine learning, the interest has shifted towards distributed optimization. In this work we present a distributed algorithm …
While classic work in convex-concave min-max optimization relies on average-iterate convergence results, the emergence of nonconvex applications such as training Generative Adversarial Networks has led to renewed interest in last-iterate convergence guarantees. Proving last-iterate convergence is challenging because ma…
New SGD analysis for nonconvex optimization finds optimal rates.
New methods optimize functions on hyperbolic and spherical spaces, matching Euclidean rates up to logarithmic factors.
Interesting theoretical associations have been established by recent papers between the fields of active learning and stochastic convex optimization due to the common role of feedback in sequential querying mechanisms. In this paper, we continue this thread in two parts by exploiting these relations for the first time …
Regularized empirical risk minimization including support vector machines plays an important role in machine learning theory. In this paper regularized pairwise learning (RPL) methods based on kernels will be investigated. One example is regularized minimization of the error entropy loss which has recently attracted qu…
Study shows Stochastic Mirror Descent optimizes convex problems with infinite noise variance.
Stochastic gradient algorithms estimate the gradient based on only one or a few samples and enjoy low computational cost per iteration. They have been widely used in large-scale optimization problems. However, stochastic gradient algorithms are usually slow to converge and achieve sub-linear convergence rates, due to t…
We consider an interest rate model with log-normally distributed rates in the terminal measure in discrete time. Such models are used in financial practice as parametric versions of the Markov functional model, or as approximations to the log-normal Libor market model. We show that the model has two distinct regimes, a…
While optimizing convex objective (loss) functions has been a powerhouse for machine learning for at least two decades, non-convex loss functions have attracted fast growing interests recently, due to many desirable properties such as superior robustness and classification accuracy, compared with their convex counterpa…
High codimension submanifolds evolve to convex shapes, leading to smooth limiting flows.
AGGLIO optimizes non-convex functions with local convexity guarantees.
The paper analyzes the mean field Langevin dynamics and its convergence rate.
Adjusting the learning rate schedule in stochastic gradient methods is an important unresolved problem which requires tuning in practice. If certain parameters of the loss function such as smoothness or strong convexity constants are known, theoretical learning rate schedules can be applied. However, in practice, such …
This study analyzes AdaGrad's stability and convergence in non-convex optimization.
This paper improves the convergence rates of bilevel optimization algorithms.
The DANE algorithm is an approximate Newton method popularly used for communication-efficient distributed machine learning. Reasons for the interest in DANE include scalability and versatility. Convergence of DANE, however, can be tricky; its appealing convergence rate is only rigorous for quadratic objective, and for …
Study cash-subadditive risk measures without quasi-convexity.
The paper improves OT map estimation rates without strict assumptions.
There are more than eight hundred interest rates published in China bond market every day. Which are the benchmark interest rates that have broad influences on most interest rates is a major concern for economists. In this paper, multi-variable Granger causality test is developed and applied to construct a directed net…
We study Frank-Wolfe methods for nonconvex stochastic and finite-sum optimization problems. Frank-Wolfe methods (in the convex case) have gained tremendous recent interest in machine learning and optimization communities due to their projection-free property and their ability to exploit structured constraints. However,…
We construct models for the pricing and risk management of inflation-linked derivatives. The models are rational in the sense that linear payoffs written on the consumer price index have prices that are rational functions of the state variables. The nominal pricing kernel is constructed in a multiplicative manner that …
Vanna-Volga is a popular method for the interpolation/extrapolation of volatility smiles. The technique is widely used in the FX markets context, due to its ability to consistently construct the entire Lognormal smile using only three Lognormal market quotes. However, the derivation of the Vanna-Volga method itself is …
We develop methods to estimate lag and parameters for multiple stable autoregressive processes.
Least Squares Estimators are suboptimal for 5D convex functions.
We study the iteration complexity of the optimistic gradient descent-ascent (OGDA) method and the extra-gradient (EG) method for finding a saddle point of a convex-concave unconstrained min-max problem. To do so, we first show that both OGDA and EG can be interpreted as approximate variants of the proximal point method…
New bounds for online convex optimization between stochastic and adversarial settings.
Paper proves CLT for quantile SGD with constant learning rate.
The currency carry trade is the investment strategy that involves selling low interest rate currencies in order to purchase higher interest rate currencies, thus profiting from the interest rate differentials. This is a well known financial puzzle to explain, since assuming foreign exchange risk is uninhibited and the …
This paper characterizes the equilibrium in a continuous time financial market populated by heterogeneous agents who differ in their rate of relative risk aversion and face convex portfolio constraints. The model is studied in an application to margin constraints and found to match real world observations about financi…
The paper examines clearing payments in financial networks to prevent cascaded defaults.
Develop a comprehensive theory for regularized M-estimation in reproducing kernel Hilbert spaces.
This research improves DeFi interest rates using a PID control system.
The space of probability distributions on a given sample space possesses natural geometric properties. For example, in the case of a smooth parametric family of probability distributions on the real line, the parameter space has a Riemannian structure induced by the embedding of the family into the Hilbert space of squ…
The present study deals with the analysis and mapping of Swiss franc interest rates. Interest rates depend on time and maturity, defining term structure of the interest rate curves (IRC). In the present study IRC are considered in a two-dimensional feature space - time and maturity. Geostatistical models and machine le…
Learning rate annealing helps even in convex problems, improving generalization.
Study proposes optimal risk-aware interest rates for crypto lending protocols.
This article is an extension of the work of one of us (Coopersmith, 2011) in deriving the relationship between certain interest rates and the inflation rate of a two component economic system. We use the well-known Fisher relation between the difference of the nominal interest rate and its inflation adjusted value to e…
Improved private AdaGrad achieves faster convergence rates for convex functions.
Developed unbiased estimators for Heston model with stochastic interest rates.
Improved subgradient method tackles ill-conditioned composite optimization problems.
Study uses weak transport for non-convex costs in fixed-income markets.