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

97194290387 · Jun 202019922001200920172026
48 results for maximal rate

Study optimizes dividend payout strategies under fluctuating interest rates.

problem Maximizing dividends under stochastic interest rates with negative values.
method Analytical HJB approach and backward SDEs for analysis.
result Explicit optimal strategies found for both time-dependent and strategy-independent stopping times.

Maximal initial learning rate for deep ReLU networks identified.

problem Finding the optimal initial learning rate for deep neural networks.
method Simple approach to estimate maximal initial learning rate ηη^{\ast}, analyzing its behavior in constant-width fully-connected ReLU networks.
result Maximal initial learning rate ηη^{\ast} is well predicted as a power of depth × width, with specific conditions for network width and input layer training.

Scientific explanation often requires inferring maximally predictive features from a given data set. Unfortunately, the collection of minimal maximally predictive features for most stochastic processes is uncountably infinite. In such cases, one compromises and instead seeks nearly maximally predictive features. Here, …

2017-02-27abs ↗pdf ↗

The paper tackles adaptive policy selection to maximize social welfare, achieving optimal regret bounds.

problem Maximizing social welfare through adaptive policy selection, considering both private utility and public revenue.
method The approach involves learning response functions through experimentation, deriving lower and upper bounds for regret, and using algorithms like Exp3.
result The algorithm achieves optimal regret bounds, showing that welfare maximization is harder than multi-armed bandit problems.

Semi-supervised EM improves convergence rate with labeled samples.

problem Improving convergence rate in EM algorithm with labeled and unlabeled data.
method Analysis of semi-supervised EM algorithm for Gaussian mixture models.
result Labeled samples significantly improve the convergence rate for the EM algorithm.

EM algorithm speeds up convergence in federated learning with heterogenous data.

problem Understanding convergence rates of federated learning algorithms under data heterogeneity.
method Characterized convergence rate of EM algorithm for FMLR model under various regimes.
result EM algorithm converges to ground truth with SNR ≥ √K in all regimes.

Proposes a novel SVM model for binary classification with different misclassification costs.

problem Real-world classification problems with varying misclassification costs.
method Incorporates performance constraints in SVM formulation to seek a hyperplane with maximal margin and misclassification rates below given thresholds.
result The proposed model gives users control over misclassification rates in one class at the expense of the other.

For a stochastic factor model we maximize the long-term growth rate of robust expected power utility with parameter λ(0,1)λ\in(0,1). Using duality methods the problem is reformulated as an infinite time horizon, risk-sensitive control problem. Our results characterize the optimal growth rate, an optimal long-term trading s…

2012-03-06abs ↗pdf ↗

Two insurance companies collaborate to maximize the probability of none going bankrupt.

problem Maximizing the probability of no company bankruptcy in a correlated Brownian motion model.
method Analyzing optimal strategies and deriving explicit formulas for minimal ruin probability.
result Maximizing collaboration benefits when Brownian motions are positively correlated.

Stochastic AUC maximization has garnered an increasing interest due to better fit to imbalanced data classification. However, existing works are limited to stochastic AUC maximization with a linear predictive model, which restricts its predictive power when dealing with extremely complex data. In this paper, we conside…

2019-08-28abs ↗pdf ↗

This paper quantifies hyperparameter transfer and finds embedding layer learning rate is key.

problem Quantifying optimal hyperparameters for large language models across scales.
method Developed three metrics to quantify hyperparameter transfer and investigated the importance of embedding layer learning rate.
result Maximal Update (μP) parameterization offers high-quality learning rate transfer compared to standard parameterization (SP).

A privacy-constrained information extraction problem is considered where for a pair of correlated discrete random variables (X,Y)(X,Y) governed by a given joint distribution, an agent observes YY and wants to convey to a potentially public user as much information about YY as possible without compromising the amount of …

2015-11-07abs ↗pdf ↗

In this paper we consider the problem of maximizing the Area under the ROC curve (AUC) which is a widely used performance metric in imbalanced classification and anomaly detection. Due to the pairwise nonlinearity of the objective function, classical SGD algorithms do not apply to the task of AUC maximization. We propo…

2019-06-14abs ↗pdf ↗

Unified learning-rate scale for CNNs and ResNets, avoiding depth imbalance.

problem Challenges in choosing an appropriate learning rate for deep networks, especially as depth increases.
method Introduces Arithmetic-Mean μμP (AM-μμP), constraining network-wide average pre-activation second moment to a constant scale, combined with residual-aware He fan-in initialization.
result Demonstrates a 3/2-3/2 scaling law for learning rates across depths, enabling zero-shot learning-rate transfer.

Maximal Rate of Stepwise Uncertainty Reduction selects simulations to reduce uncertainty efficiently.

problem Efficiently estimating quantities of interest from multi-fidelity simulations.
method Bayesian sequential strategy that maximizes the ratio of expected uncertainty reduction to simulation cost.
result MR-SUR strategy unifies and provides principled approaches to develop new methods.

Establishes geometric convergence of iterative optimization algorithms.

problem Analyzes convergence of iterative optimization algorithms under general assumptions.
method General framework for iterative optimization algorithms, proving asymptotic geometric convergence and providing convergence rates.
result Asymptotic geometric convergence of iterative optimization algorithms with exact rate.

ReduNet optimizes data compression by maximizing rate reduction in deep networks.

problem Optimizing deep networks for high-dimensional multi-class data.
method Maximizing rate reduction through iterative gradient ascent, leading to a multi-layer deep network.
result ReduNet achieves optimal linear discriminative representation and is more efficient in the spectral domain.

We consider the problem of robustly maximizing the growth rate of investor wealth in the presence of model uncertainty. Possible models are all those under which the assets' region EE and instantaneous covariation cc are known, and where additionally the assets are stable in that their occupancy time measures converg…

2018-01-19abs ↗pdf ↗

We consider a financial market model driven by an R^n-valued Gaussian process with stationary increments which is different from Brownian motion. This driving noise process consists of nn independent components, and each component has memory described by two parameters. For this market model, we explicitly solve optim…

2005-06-30abs ↗pdf ↗

The disbalance of Supply and Demand is typically considered as the driving force of the markets. However, the measurement or estimation of Supply and Demand at price different from the execution price is not possible even after the transaction. An approach in which Supply and Demand are always matched, but the rate $I=…

2016-02-14abs ↗pdf ↗

We determine the optimal strategy for investing in a Black-Scholes market in order to maximize the probability that wealth at death meets a bequest goal bb, a type of goal-seeking problem, as pioneered by Dubins and Savage (1965, 1976). The individual consumes at a constant rate cc, so the level of wealth required fo…

2015-03-03abs ↗pdf ↗

Traditional voxel-level multiple testing procedures in neuroimaging, mostly pp-value based, often ignore the spatial correlations among neighboring voxels and thus suffer from substantial loss of power. We extend the local-significance-index based procedure originally developed for the hidden Markov chain models, whic…

2014-04-04abs ↗pdf ↗

We explicitly test if the reliability of credit ratings depends on the total number of admissible states. We analyse open access credit rating data and show that the effect of the number of states in the dynamical properties of ratings change with time, thus giving supportive evidence that the ideal number of admissibl…

2014-09-09abs ↗pdf ↗

The Dybvig-Ingersoll-Ross (DIR) theorem states that, in arbitrage-free term structure models, long-term yields and forward rates can never fall. We present a refined version of the DIR theorem, where we identify the reciprocal of the maturity date as the maximal order that long-term rates at earlier dates can dominate …

2009-01-14abs ↗pdf ↗

MILLION framework optimizes portfolio risk and return efficiently.

problem Optimizing risk and return in AI for FinTech portfolio management.
method Two phases: return maximization with auxiliary objectives and risk control with portfolio interpolation and improvement.
result Framework achieves fine-grained risk control and improved return rates.

This work studies learning curves for revenue maximization algorithms.

problem Understanding the performance of revenue-maximizing algorithms as they learn from more data.
method Initiates the study of learning curves for revenue maximization, providing a near-complete characterization of their rate of decay.
result Learning curves for revenue maximization can decay arbitrarily slowly or almost exponentially fast, depending on the distribution and optimal revenue.

We investigate the ergodic problem of growth-rate maximization under a class of risk constraints in the context of incomplete, Itô-process models of financial markets with random ergodic coefficients. Including {\em value-at-risk} (VaR), {\em tail-value-at-risk} (TVaR), and {\em limited expected loss} (LEL), these cons…

2007-06-04abs ↗pdf ↗

Proof of learning rate transfer in MLPs with μμP parameterization.

problem Understanding and optimizing learning rates in neural networks with different parameterizations.
method Theoretical analysis and empirical validation of learning rate transfer in MLPs with μμP, SP, and NTP parameterizations.
result The optimal learning rate converges to a non-zero constant as width goes to infinity under μμP, explaining learning rate transfer.

Paper establishes convergence rates and concentration bounds for stochastic approximation and reinforcement learning with Markovian noise.

problem Analyzing convergence rates and concentration bounds for stochastic approximation and reinforcement learning with Markovian noise.
method Novel discretization of the mean ODE of stochastic approximation algorithms using intervals with diminishing length.
result First almost sure convergence rate and maximal concentration bound with exponential tails for contractive stochastic approximation algorithms with Markovian noise.