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

Trend · papers per month

3927831,1751,566 · Jun 202019922001200920172026
48 results for Absolute Learning Progress

Framework improves agent's ability to learn from noisy images.

problem Agents tend to focus on distracting regions in unsupervised image-based goal exploration.
method Proposes a novel framework combining absolute Learning Progress with unsupervised image-based goal exploration.
result Agents successfully identify and ignore distracting regions, improving overall performance.

Model predicts cannabis use disorder risk for adolescents and young adults.

problem Predicting cannabis use disorder progression in adolescents and young adults.
method Bayesian machine learning model trained on longitudinal data.
result Model provides personalized risk assessment with AUC of 0.68-0.75 and E/O ratio of 0.95-1.

Progress in probabilistic generative models has accelerated, developing richer models with neural architectures, implicit densities, and with scalable algorithms for their Bayesian inference. However, there has been limited progress in models that capture causal relationships, for example, how individual genetic factor…

2017-10-30abs ↗pdf ↗

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.

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.

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.

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.

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 study grassmannians associated with a linear space with a nondegenerate hermitian form. The geometry of these grassmannians allows us to explain the relation between a (pseudo-)riemannian projective geometry and the conformal structure on its ideal boundary (absolute). Such relation encompasses, for instance, the us…

2009-07-26abs ↗pdf ↗

The paper bounds the mean absolute error in DNN vector-to-vector regression.

problem Bounding the mean absolute error in deep neural network based vector-to-vector regression.
method Error decomposition techniques in statistical learning theory and non-convex optimization theory were used to derive upper bounds for approximation, estimation, and optimization errors.
result Theoretical upper bounds for mean absolute error in DNN vector-to-vector regression were derived and validated experimentally.

Combines absolute and relative wealth in portfolio optimization with power utility functions.

problem Optimizing portfolios with both absolute and relative wealth considerations.
method Integrates power utility functions for absolute and relative wealth, considering multiple benchmarks.
result Obtains an explicit solution for portfolio optimization combining absolute and relative wealth.

Improved self-supervised learning on ImageNet achieves top-1 accuracy of 77.1%.

problem Self-supervised ResNets underperform supervised learning on ImageNet.
method ReLICv2 combines explicit invariance loss with contrastive objective over varied data views.
result ReLICv2 achieves 77.1% top-1 accuracy on ImageNet, improving over previous state-of-the-art by 1.5%.

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.

Absolutely partially hyperbolic surface endomorphisms have a coherent center foliation.

problem Understanding the dynamics of absolutely partially hyperbolic surface endomorphisms.
method Showed the existence of a center foliation and leaf conjugacy to the linearization.
result Absolutely partially hyperbolic surface endomorphisms have a dynamically coherent center foliation.

The paper introduces Absolute Shapley Value to handle negative contributions in machine learning model training.

problem Negative marginal contributions in machine learning model training.
method Investigates three philosophies: Original Shapley Value, Zero Shapley Value, and Absolute Shapley Value.
result Absolute Shapley Value significantly outperforms other definitions in evaluating data importance.

We introduce a conceptually simple and scalable framework for continual learning domains where tasks are learned sequentially. Our method is constant in the number of parameters and is designed to preserve performance on previously encountered tasks while accelerating learning progress on subsequent problems. This is a…

2018-05-16abs ↗pdf ↗

Deep neural nets on 1-D data are convex Lasso models with reflection features.

problem Training neural networks on 1-D data.
method Proving equivalence to convex Lasso problems with discrete, explicitly defined dictionary matrices.
result Reflection features in neural networks with certain activations.

Neural networks learn distance-based representations, not just intensity.

problem Understanding how neural networks interpret and learn from internal activations.
method Manipulated ReLU and Absolute Value activations to observe sensitivity to distance and intensity perturbations.
result Neural networks are highly sensitive to small distance-based perturbations, challenging the intensity-based interpretation.

The paper studies curves in Finsler-like spaces and their properties.

problem Investigating properties of curves in asymmetric metric spaces induced by Finsler structures.
method Analyzes three types of absolutely continuous curves in Finsler-like spaces and establishes the Lisini structure theorem.
result Characterizes the nature of absolutely continuous curves in terms of dynamical transference plans.

Researchers compute Bayes error for classification models using normalizing flows.

problem Evaluating the inherent difficulty of classification problems.
method Invertible transformations and Gaussian base distributions to compute Bayes error.
result State-of-the-art models can achieve near-optimal accuracy but not always.

LALR adapts learning rate for faster convergence in regression and neural nets.

problem Finding optimal learning rates for faster convergence in regression and neural networks.
method Lipschitz continuity theory applied to Mean Absolute Error and Quantile loss functions.
result Adaptive learning rate policy enables up to 20x faster convergence.

This paper extends results of Mortimer and Williams (1991) about changes of probability measure up to a random time under the assumptions that all martingales are continuous and that the random time avoids stopping times. We consider locally absolutely continuous measure changes up to a random time, changes of probabil…

2013-09-24abs ↗pdf ↗

Study absolute continuity of Wasserstein barycenters on manifolds with singular cost functions.

problem Absolute continuity of Wasserstein barycenters on manifolds with singular cost functions.
method Approximation framework to handle singularity, geometrically transparent.
result Precise analytic condition on cost profile for necessary assumptions.

Deep neural networks solve Raven's Progressive Matrices with high accuracy.

problem Testing relational reasoning in machine learning systems.
method Combining Wild Relation Networks with Multi-Layer Relation Networks and introducing Magnitude Encoding.
result Deep neural networks achieve 98.0 percent accuracy, significantly improving over previous methods.

We show how to construct absolutely exotic smooth structures on compact 4-manifolds with boundary, including contractible manifolds. In particular, we prove that any compact smooth 4-manifold W with boundary that admits a relatively exotic structure contains a pair of codimension-zero submanifolds homotopy equivalent t…

2014-10-06abs ↗pdf ↗

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.

In a recent joint work with V. Turaev (cf. math.DG/9810114) we defined a new concept of combinatorial torsion which we called absolute torsion. Compared with the classical Reidemeister torsion it has the advantage of having a well-defined sign. Also, the absolute torsion is defined for arbitrary orientable flat vector …

1999-03-23abs ↗pdf ↗

A compactum X is an `absolute cone' if, for each of its points x, the space X is homeomorphic to a cone with x corresponding to the cone point. In 1971, J. de Groot conjectured that each n-dimensional absolute cone is an n-cell. In this paper, we give a complete solution to that conjecture. In particular, we show that …

2005-07-19abs ↗pdf ↗