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

176351527702 · Jun 202019922001200920172026
48 results for Progression Function

Paper introduces a new curriculum generation method for reinforcement learning.

problem Improving reinforcement learning performance and speed through curriculum learning.
method The paper proposes a novel curriculum generation paradigm based on progression and mapping functions.
result Empirical results show the new approach outperforms state-of-the-art algorithms.

Gradient span algorithms show consistent progress in high dimensions.

problem Understanding consistent training progress in large machine learning models.
method Proving deterministic behavior of gradient span algorithms on Gaussian random functions.
result Gradient span algorithms have asymptotically deterministic behavior in high dimensions.

Develops a machine learning model to predict ALS progression and assistive device use.

problem Challenges in predicting clinically meaningful milestones in ALS.
method Integrates longitudinal ALSFRS-R trajectories with survival modeling.
result Generates individualized survival curves and predicts wheelchair-free survival.

An algorithm solves optimization problems with large sample sets, improving worst-case complexity.

problem Continuous nonlinear-equality-constrained optimization problems with large numbers of terms.
method Progressively sampled finite sets to solve related problems with growing sample sizes.
result Better worst-case sample complexity compared to solving with full sets of samples.

Wealth redistribution through Fokker-Planck equation controls preserves Gini coefficient.

problem Preserving Gini coefficient through proportional wealth tax.
method Formulating optimal redistribution as a control problem for Fokker-Planck equation.
result Progressive taxes redistribute within policy-relevant timescales.

In clinical practice and biomedical research, measurements are often collected sparsely and irregularly in time while the data acquisition is expensive and inconvenient. Examples include measurements of spine bone mineral density, cancer growth through mammography or biopsy, a progression of defective vision, or assess…

2018-09-24abs ↗pdf ↗

In this article, we investigate when the set of primitive geodesic lengths on a Riemannian manifold have arbitrarily long arithmetic progressions. We prove that in the space of negatively curved metrics, a metric having such arithmetic progressions is quite rare. We introduce almost arithmetic progressions, a coarsific…

2014-01-29abs ↗pdf ↗

In this work, we provide an efficient and realistic data-driven approach to simulate astronomical images using deep generative models from machine learning. Our solution is based on a variant of the generative adversarial network (GAN) with progressive training methodology and Wasserstein cost function. The proposed so…

2019-09-26abs ↗pdf ↗

Optimizes CM for stochastic convex optimization with progressive precision.

problem Stochastic nature of objective function in convex optimization.
method Iterative coordinate minimization with optimal precision control.
result Order-optimal regret performance for strongly convex and nonsmooth functions.

The paper improves evolutionary computation by optimizing selection rates.

problem Choosing the right selection rate in evolutionary computation.
method The paper proves mathematically that a selection rate of μ/λ leads to better progress rates and provides a theoretical basis for this.
result The theoretical selection rate μ/λ leads to a better progress rate of order O(λ^-1) compared to O(λ^-2/d).

A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.

problem Optimizing Bayesian filtering with deterministic particles to avoid degeneration.
method Progressive flow of particles through a sequence of sub-steps, each using an optimal transport map to replace non-equally weighted particles with equally weighted ones.
result The method avoids particle degeneration and simplifies the filtering process by not requiring inversions or monotonicity constraints.

Paper develops efficient RL algorithm for general value function approximation.

problem Lack of theory for RL with general value function approximation.
method Provable efficient RL algorithm using bounded eluder dimension.
result Achieves a regret bound of O~(poly(dH)T)\widetilde{O}(\mathrm{poly}(dH)\sqrt{T}).

AL2 progressively penalizes network activations to prevent overfitting.

problem Avoiding overfitting in neural networks with limited training data.
method Progressive Activation Loss (PAL) method to regularize network representations.
result AL2 outperforms traditional regularization methods on benchmark datasets.

Study on hyperbolic manifolds and their boundary data, focusing on volume functions.

problem Determining the hyperbolic metric from boundary data of convex co-compact hyperbolic manifolds.
method Analysis of volume functions and their relation to boundary data, using first variations.
result New connections with physics and probability theory, with open questions remaining.

We develop an algorithm for systematic design of a large artificial neural network using a progression property. We find that some non-linear functions, such as the rectifier linear unit and its derivatives, hold the property. The systematic design addresses the choice of network size and regularization of parameters. …

2017-10-23abs ↗pdf ↗

We discuss the issue of branching in quasiregular mapping, and in particular the relation between branching and the problem of finding geometric parametrizations for topological manifolds. Other recent progress and open problems of a more function theoretic nature are also presented.

2003-04-22abs ↗pdf ↗

The standard L-BFGS method relies on gradient approximations that are not dominated by noise, so that search directions are descent directions, the line search is reliable, and quasi-Newton updating yields useful quadratic models of the objective function. All of this appears to call for a full batch approach, but sinc…

2018-02-15abs ↗pdf ↗

This paper improves disentanglement in VAEs by progressively learning hierarchical representations.

problem Compromised disentanglement in VAEs due to high-level abstraction extraction.
method Progressive learning of independent hierarchical representations from high to low levels.
result Improved disentanglement demonstrated on two benchmark datasets using new metrics.

The purpose of this paper relies on the study of long term yield curves modeling. Inspired by the economic litterature, it provides a financial interpretation of the Ramsey rule that links discount rate and marginal utility of aggregate optimal consumption. For such a long maturity modelization, the possibility of adju…

2014-04-07abs ↗pdf ↗

In this article, we prove that every arithmetic locally symmetric orbifold of classical type without Euclidean or compact factors has arbitrarily long arithmetic progressions in its primitive length spectrum. Moreover, we show the stronger property that every primitive length occurs in arbitrarily long arithmetic progr…

2016-02-04abs ↗pdf ↗

In complex tasks, such as those with large combinatorial action spaces, random exploration may be too inefficient to achieve meaningful learning progress. In this work, we use a curriculum of progressively growing action spaces to accelerate learning. We assume the environment is out of our control, but that the agent …

2019-06-28abs ↗pdf ↗

Study uses machine learning and survival analysis to predict CKD progression.

problem Early detection and management of CKD to reduce ESRD risk.
method Combines machine learning and classical statistical models to identify novel CKD progression predictors.
result Deep learning models outperform other methods in predicting CKD progression.

Machine learning impacts computational math, offering new functions approximations.

problem Machine learning's black box nature hinders further progress in computational math.
method Analyzes machine learning's impact on computational math and vice versa.
result Integrating computational math with machine learning can enhance both fields.

We discuss classical gravitational aspects of the AdS/CFT correspondence, with the aim of obtaining a rigorous (mathematical) understanding of the semi-classical limit of the gravitational partition function. The paper surveys recent progress in the area, together with a selection of new results and open problems.

2004-03-08abs ↗pdf ↗

Closed-form solutions derived for perpetual options under insider models.

problem Pricing perpetual American standard and lookback options for insiders.
method Closed-form solutions derived using progressively enlarged filtrations and optimal stopping problems.
result Optimal exercise times determined based on asset price maximum or minimum.

Study finds little progress in medical machine learning benchmarks over 3 years.

problem Lack of meaningful progress in medical machine learning benchmarks for structured healthcare data.
method Comprehensive review and meta-analysis of benchmarks in medical machine learning for structured data.
result Deep recurrent models perform only better than logistic regression on certain clinical prediction tasks.

We survey some of the recent progress on complete gradient shrinking Ricci solitons, including the classifications in dimension three and asymptotic behavior of potential functions as well as volume growths of geodesic balls in higher dimensions. This article is written for the conference proceedings dedicated to Yau's…

2009-03-23abs ↗pdf ↗

Deep learning's success requires vast computing power, making future progress unsustainable.

problem Deep learning's success is heavily dependent on computing power, making future progress unsustainable.
method Cataloging and extrapolating the dependency on computing power for various deep learning applications.
result Continued progress in deep learning applications will require more computationally-efficient methods.

Despite the advancement of supervised image recognition algorithms, their dependence on the availability of labeled data and the rapid expansion of image categories raise the significant challenge of zero-shot learning. Zero-shot learning (ZSL) aims to transfer knowledge from labeled classes into unlabeled classes to r…

2018-05-18abs ↗pdf ↗