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

1122 · Jul 202019922001200920172026
12 results for progress-based

Curriculum learning speeds up agent learning in Minecraft, a complex visual domain.

problem Training agents to learn multiple tasks in a complex, visual domain.
method Learning-progress based curriculum and dynamic exploration bonuses.
result Curriculum learning improves agent performance in a complex reinforcement learning problem.

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.

Compared to machines, humans are extremely good at classifying images into categories, especially when they possess prior knowledge of the categories at hand. If this prior information is not available, supervision in the form of teaching images is required. To learn categories more quickly, people should see important…

2015-04-28abs ↗pdf ↗

Unsupervised image-to-image translation has gained considerable attention due to the recent impressive progress based on generative adversarial networks (GANs). However, previous methods often fail in challenging cases, in particular, when an image has multiple target instances and a translation task involves significa…

2018-12-28abs ↗pdf ↗

A lightweight model predicts IT system KPIs from historical data.

problem Predicting future KPIs of interconnected IT systems is hard due to diverse and changing components.
method A weighted heterogeneous ensemble method combining neural network and mean predictor.
result Achieved R2R^2 scores of 0.10 and 0.15 on test data.

The study examines how many samples are needed to minimize a noisy convex function with inaccurate gradient estimates.

problem Determining the number of samples needed to minimize a noisy convex function with inaccurate gradient estimates.
method Using Stochastic Convex Optimization as a case study, the study analyzes the relationship between the number of samples and the accuracy of gradient estimates.
result The study provides partial answers to the question, showing that a general analyst requires Ω(1/ε3)Ω(1/ε^3) samples and that under certain assumptions, ildeΩ(1/ε2.5) ilde Ω(1/ε^{2.5}) samples are necessary for gradient descent to interact with the oracle.