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

Trend · papers per month

229459688917 · Jun 202019922001200920172026
48 results for algorithmic progress

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.

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.

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.

Improves disease progression prediction using auxiliary surrogate labels and health markers.

problem Challenges in predicting disease progression due to unknown true disease states.
method Integrates hidden Markov model with time-varying discriminative classification model.
result Significant improvement in distinguishing LBD from AD using objective markers.

Summarizes key algorithmic trading problems and recent advances.

problem Optimal execution, placement, and price impact in algorithmic trading.
method Discusses recent advances in algorithmic trading using Machine Learning techniques.
result Recent progress in algorithmic trading includes the use of Deep Learning, Reinforcement Learning, and Generative Adversarial Networks.

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 ↗

Health professionals can use natural language processing (NLP) technologies when reviewing electronic health records (EHR). Machine learning free-text classifiers can help them identify problems and make critical decisions. We aim to develop deep learning neural network algorithms that identify EHR progress notes perta…

2018-09-16abs ↗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 ↗

Study shows code-level optimizations significantly impact deep RL algorithms.

problem Understanding the impact of implementation details on deep RL algorithms.
method Case study on PPO and TRPO, investigating the effects of code-level optimizations.
result Code-level optimizations are crucial for performance in deep RL algorithms.

Arguably, unsupervised learning plays a crucial role in the majority of algorithms for processing brain imaging. A recently introduced unsupervised approach Deep InfoMax (DIM) is a promising tool for exploring brain structure in a flexible non-linear way. In this paper, we investigate the use of variants of DIM in a se…

2019-04-24abs ↗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.

Recent anomaly detection benchmarks are flawed, potentially misleading progress.

problem Flawed benchmark datasets create misleading progress reports.
method Identified four flaws in benchmark datasets and introduced a new archive.
result Published comparisons may be unreliable due to flaws in benchmark datasets.

Proposes a progressive label correction method for feature-dependent label noise.

problem Real-world large-scale datasets often suffer from heterogeneous, feature-dependent label noise.
method A progressive label correction algorithm that iteratively refines the model.
result A classifier trained with this strategy converges to be consistent with the Bayes classifier for various noise patterns.

Progressive Neural Network Learning is a class of algorithms that incrementally construct the network's topology and optimize its parameters based on the training data. While this approach exempts the users from the manual task of designing and validating multiple network topologies, it often requires an enormous numbe…

2020-02-17abs ↗pdf ↗

Professional baseball players are increasingly guaranteed expensive long-term contracts, with over 70 deals signed in excess of \$90 million, mostly in the last decade. These are substantial sums compared to a typical franchise valuation of \$1-2 billion. Hence, the players to whom a team chooses to give such a contrac…

2017-12-15abs ↗pdf ↗

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 ↗

In this paper, we investigate a new form of automated curriculum learning based on adaptive selection of accuracy requirements, called accuracy-based curriculum learning. Using a reinforcement learning agent based on the Deep Deterministic Policy Gradient algorithm and addressing the Reacher environment, we first show …

2018-06-25abs ↗pdf ↗

Recent progress in the development of efficient computational algorithms to price financial derivatives is summarized. A first algorithm is based on a path integral approach to option pricing, while a second algorithm makes use of a neural network parameterization of option prices. The accuracy of the two methods is es…

2002-11-13abs ↗pdf ↗

Bounding the generalization error of learning algorithms has a long history, which yet falls short in explaining various generalization successes including those of deep learning. Two important difficulties are (i) exploiting the dependencies between the hypotheses, (ii) exploiting the dependence between the algorithm'…

2018-06-11abs ↗pdf ↗

Partial-label learning (PLL) is a typical weakly supervised learning problem, where each training instance is equipped with a set of candidate labels among which only one is the true label. Most existing methods elaborately designed learning objectives as constrained optimizations that must be solved in specific manner…

2020-02-19abs ↗pdf ↗

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}).

The aim of this paper is to discuss some applications of general topology in computer algorithms including modeling and simulation, and also in computer graphics and image processing. While the progress in these areas heavily depends on advances in computing hardware, the major intellectual achievements are the algorit…

2012-01-19abs ↗pdf ↗

Deep neural network algorithms are difficult to analyze because they lack structure allowing to understand the properties of underlying transforms and invariants. Multiscale hierarchical convolutional networks are structured deep convolutional networks where layers are indexed by progressively higher dimensional attrib…

2017-03-12abs ↗pdf ↗

Introduces new gradient-based methods for machine learning problems.

problem New challenges in machine learning due to decision-making and multi-agent problems.
method Gradient-based optimization and variational inequalities.
result Shifts focus from pattern recognition to decision-making and multi-agent problems.

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 ↗