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

98195293390 · May 202619922001200920172026
48 results for saturation condition

We extend the adaptive regression spline model by incorporating saturation, the natural requirement that a function extend as a constant outside a certain range. We fit saturating splines to data using a convex optimization problem over a space of measures, which we solve using an efficient algorithm based on the condi…

2016-09-21abs ↗pdf ↗

A general nonlinear logistic equation has been proposed to model long-time saturation in industrial growth. An integral solution of this equation has been derived for any arbitrary degree of nonlinearity. A time scale for the onset of nonlinear saturation in industrial growth can be estimated from an equipartition cond…

2009-03-02abs ↗pdf ↗

This paper explores saturation effects in spectral algorithms over large dimensions.

problem Saturation effects in spectral algorithms over large dimensions.
method Improved minimax lower bound and gradient flow with early stopping strategy.
result Exact convergence rates of spectral algorithms in large dimensional settings.

New examples show deletion type admissible pairs can be rigid under rational saturation.

problem Rigidity of admissible pairs of rational homogeneous spaces of Picard number one.
method Application of Mok's general criterion for non-subdiagram type admissible pairs.
result Examples of deletion type admissible pairs are rigid under rational saturation.

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.

We propose a metric, Layer Saturation, defined as the proportion of the number of eigenvalues needed to explain 99% of the variance of the latent representations, for analyzing the learned representations of neural network layers. Saturation is based on spectral analysis and can be computed efficiently, making live ana…

2019-07-19abs ↗pdf ↗

A homogeneously saturated equation for the time development of the price of a financial asset is presented and investigated for the pricing of European call options using noise that is distributed as a Student's t-distribution. In the limit that the saturation parameter of the equation equals zero, the standard model o…

2013-01-24abs ↗pdf ↗

Neural marked point processes show saturation with complexity, leading to new simple architectures.

problem Performance saturation in neural marked point processes with complex architectures.
method Proposed GCHP with graph convolutional layers and likelihood ratio loss.
result GCHP reduces training time and improves model performance.

Entrocraft addresses RL performance saturation in LLMs by customizing entropy curves.

problem Performance saturation in RL algorithms for LLMs.
method Entrocraft uses rejection sampling to bias advantage distributions for customized entropy schedules.
result Entrocraft significantly improves generalization, output diversity, and long-term training in 4B models.

New insights explain speedup saturation in distributed learning with large batches and delays.

problem Understanding and optimizing speedup in distributed learning with large batches and delays.
method Theoretical analysis of strongly convex, convex, and non-convex settings, considering data sparsity.
result Identification of a data-dependent parameter explaining speedup saturation in both batch size and gradient staleness.

The closed string field theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2π. Through every point in such a metric there is a geodesic that saturates the length condition, and saturating geodesics …

2018-06-01abs ↗pdf ↗

As one of standard approaches to train deep neural networks, dropout has been applied to regularize large models to avoid overfitting, and the improvement in performance by dropout has been explained as avoiding co-adaptation between nodes. However, when correlations between nodes are compared after training the networ…

2018-06-26abs ↗pdf ↗

The paper develops a theory for iterative self-improvement of models, proving conditions for better performance with easy-to-hard curricula.

problem Lack of theoretical foundation for iterative self-improvement in practical settings.
method Modeling self-improvement as maximum-likelihood fine-tuning on reward-filtered distributions and proving finite-sample guarantees.
result Explicit feedback loop and conditions for better performance with easy-to-hard curricula.

Common nonlinear activation functions used in neural networks can cause training difficulties due to the saturation behavior of the activation function, which may hide dependencies that are not visible to vanilla-SGD (using first order gradients only). Gating mechanisms that use softly saturating activation functions t…

2016-03-01abs ↗pdf ↗

If (M,g)(M,g) is a compact real analytic Riemannian manifold, we give a necessary and sufficient condition for there to be a sequence of quasimodes of order o(λ)o(λ) saturating sup-norm estimates. In particular, it gives optimal conditions for existence of eigenfunctions satisfying maximal sup norm bounds. The condition is …

2013-11-15abs ↗pdf ↗

Study shows scaling up models doesn't always improve downstream tasks.

problem Understanding why scaling up models doesn't always improve downstream performance.
method Systematic study of 4800 experiments on various models, analyzing performance on 20 downstream tasks.
result Performance on downstream tasks saturates as model size increases, revealing a nonlinear relationship.

Soft-Radial Projection solves gradient saturation in constrained deep learning.

problem Gradient saturation in deep learning models when integrating hard constraints.
method Introduces Soft-Radial Projection, a differentiable layer that maps predictions onto constraint boundaries without rank-deficient Jacobians.
result Improves convergence and solution quality over state-of-the-art methods.

The paper derives upper bounds on eigenvalues of Laplace-Beltrami operator on hyperbolic surfaces.

problem Finding upper bounds on eigenvalues of Laplace-Beltrami operator on hyperbolic surfaces.
method Using spectral decompositions and consistency conditions derived from quadruple overlap integrals in terms of triple overlap integrals.
result Derives upper bounds on eigenvalues, nearly saturated by the Bolza surface.

EoS selectively shapes learning, affecting some groups more than others.

problem EoS affects learning differently across the data distribution.
method Branching intervention to enter or exit EoS regime, controlled perturbation to isolate mechanisms.
result EoS redistributes learning, amplifying progress on some groups and suppressing others.

We undertake a fundamental study of network equilibria modeled as solutions of fixed point equations for monotone linear functions with saturation nonlinearities. The considered model extends one originally proposed to study systemic risk in networks of financial institutions interconnected by mutual obligations and is…

2019-12-10abs ↗pdf ↗

Open, connected, saturated sets W without holonomy in codimension one foliations play key roles as fundamental building blocks. Here, for the case of foliated 3-manifolds, we produce a finite system of closed, convex, non-overlapping polyhedral cones in the first cohomology of W with real coefficients such that the iso…

2011-08-03abs ↗pdf ↗

Noiseless KRR achieves optimal rates and exhibits saturation effects.

problem Understanding optimal rates and saturation phenomena in noiseless kernel ridge regression.
method Comprehensive study of noiseless KRR, establishing minimax optimal rates and uncovering phenomena of extra-smoothness and saturation.
result Noiseless KRR achieves minimax optimal rates and exhibits saturation effects.

Investigates optimal parameter allocation in Transformers for efficiency and expressivity.

problem Balancing expressivity and efficiency in Transformer model parameters.
method Mathematical analysis and theoretical characterization of attention heads and head dimensions.
result Later layers can operate more efficiently with reduced parameters due to saturation of softmax activations.

We define the representation ring of a saturated fusion system F\mathcal F as the Grothendieck ring of the semiring of F\mathcal F-stable representations, and study the dimension functions of F\mathcal F-stable representations using the transfer map induced by the characteristic idempotent of F\mathcal F. We find a…

2016-03-27abs ↗pdf ↗

For a stable marginally outer trapped surface (MOTS) in an axially symmetric spacetime with cosmological constant Λ>0Λ> 0 and with matter satisfying the dominant energy condition, we prove that the area AA and the angular momentum JJ satisfy the inequality 8πJA(1ΛA/4π)(1ΛA/12π)8π|J| \le A\sqrt{(1-ΛA/4π)(1-ΛA/12π)} which is saturated pre…

2015-01-28abs ↗pdf ↗

In a previous article, we defined a very flexible notion of suborbifold and characterized those suborbifolds which can arise as the images of orbifold embeddings. In particular, suborbifolds are images of orbifold embeddings precisely when they are saturated and split. This article addresses the problem of orbifold str…

2016-06-19abs ↗pdf ↗