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.
Proposes a simple framework to balance task difficulty in multi-task learning.
New measure quantifies task difficulty for machine learning models.
Study shows perceptual boost of visual attention varies with task difficulty and size.
Proposes PIC and POIC for measuring task difficulty in RL.
Entity Linking (EL) is the task of automatically identifying entity mentions in a piece of text and resolving them to a corresponding entity in a reference knowledge base like Wikipedia. There is a large number of EL tools available for different types of documents and domains, yet EL remains a challenging task where t…
This study introduces balanced DRPS and OrderedLogitNN for better QDE of discrete-level questions.
Transformers learn to adapt to different task difficulties and resist distribution shifts.
The paper explores when to prioritize easy or hard samples in learning tasks.
Successfully navigating a complex environment to obtain a desired outcome is a difficult task, that up to recently was believed to be capable only by humans. This perception has been broken down over time, especially with the introduction of deep reinforcement learning, which has greatly increased the difficulty of tas…
VLM judges rank well but score poorly; task difficulty and annotation quality affect interval width.
Algorithm learns to solve tasks by gradually expanding policy space.
Time-continuous emotion prediction has become an increasingly compelling task in machine learning. Considerable efforts have been made to advance the performance of these systems. Nonetheless, the main focus has been the development of more sophisticated models and the incorporation of different expressive modalities (…
CLOPS improves deep learning for continuous physiological data.
Reinforcement learning is a promising approach to developing hard-to-engineer adaptive solutions for complex and diverse robotic tasks. However, learning with real-world robots is often unreliable and difficult, which resulted in their low adoption in reinforcement learning research. This difficulty is worsened by the …
Paper defines a new distance metric for comparing learning tasks.
In the present work we propose a Deep Feed Forward network architecture which can be trained according to a sequential learning paradigm, where tasks of increasing difficulty are learned sequentially, yet avoiding catastrophic forgetting. The proposed architecture can re-use the features learned on previous tasks in a …
New method learns optimal environment and goal difficulty for reinforcement learning.
In this work, we introduce the concept of bandlimiting into the theory of machine learning because all physical processes are bandlimited by nature, including real-world machine learning tasks. After the bandlimiting constraint is taken into account, our theoretical analysis has shown that all practical machine learnin…
Differentiable ABMs face challenges in inference and optimisation.
The paper develops a theory for iterative self-improvement of models, proving conditions for better performance with easy-to-hard curricula.
Despite the significant advances in recent years, Generative Adversarial Networks (GANs) are still notoriously hard to train. In this paper, we propose three novel curriculum learning strategies for training GANs. All strategies are first based on ranking the training images by their difficulty scores, which are estima…
This report contains the details regarding our submission to the OffensEval 2019 (SemEval 2019 - Task 6). The competition was based on the Offensive Language Identification Dataset. We first discuss the details of the classifier implemented and the type of input data used and pre-processing performed. We then move onto…
Paper proves impossibility of three desirable properties in node embedding.
A new method estimates uncertainty without explicit prediction models.
Paper recovers top-two answers and confusion probability in multi-choice crowdsourcing.
Learning-to-learn or meta-learning leverages data-driven inductive bias to increase the efficiency of learning on a novel task. This approach encounters difficulty when transfer is not advantageous, for instance, when tasks are considerably dissimilar or change over time. We use the connection between gradient-based me…
CogScale benchmarks AI architectures for sequential processing.
Paper provides conditions for reliable use of pre-trained embeddings in econometrics.
Single-stage neural architecture improves text-to-image synthesis.
Learning shrinks hard tail, improving inference performance.
AER dynamically adjusts entropy regularization for better LLM reinforcement learning.
We propose an active learning method for discovering low-dimensional structure in high-dimensional Gaussian process (GP) tasks. Such problems are increasingly frequent and important, but have hitherto presented severe practical difficulties. We further introduce a novel technique for approximately marginalizing GP hype…
The paper studies how to allocate human validation in AI-assisted tasks to minimize errors.
One of the main difficulties in analyzing neural networks is the non-convexity of the loss function which may have many bad local minima. In this paper, we study the landscape of neural networks for binary classification tasks. Under mild assumptions, we prove that after adding one special neuron with a skip connection…
GANs struggle with density estimation on simple datasets, while normalizing flows perform well.
Experience replay is an important technique for addressing sample-inefficiency in deep reinforcement learning (RL), but faces difficulty in learning from binary and sparse rewards due to disproportionately few successful experiences in the replay buffer. Hindsight experience replay (HER) was recently proposed to tackle…
Paper tackles medical image diagnosis with unsupervised domain adaptation.
We propose a novel approach for estimating the difficulty and transferability of supervised classification tasks. Unlike previous work, our approach is solution agnostic and does not require or assume trained models. Instead, we estimate these values using an information theoretic approach: treating training labels as …
New framework optimizes deep learning training by deferring large batch sizes to late stages.
Policy optimization on high-dimensional continuous control tasks exhibits its difficulty caused by the large variance of the policy gradient estimators. We present the action subspace dependent gradient (ASDG) estimator which incorporates the Rao-Blackwell theorem (RB) and Control Variates (CV) into a unified framework…
Shaping in humans and animals has been shown to be a powerful tool for learning complex tasks as compared to learning in a randomized fashion. This makes the problem less complex and enables one to solve the easier sub task at hand first. Generating a curriculum for such guided learning involves subjecting the agent to…
Neural network learns its size and structure during training.
PCHID improves sample efficiency in reinforcement learning tasks.
This paper introduces Task 2 of the DCASE2019 Challenge, titled "Audio tagging with noisy labels and minimal supervision". This task was hosted on the Kaggle platform as "Freesound Audio Tagging 2019". The task evaluates systems for multi-label audio tagging using a large set of noisy-labeled data, and a much smaller s…
Reward shaping is one of the most effective methods to tackle the crucial yet challenging problem of credit assignment in Reinforcement Learning (RL). However, designing shaping functions usually requires much expert knowledge and hand-engineering, and the difficulties are further exacerbated given multiple similar tas…
Improves model calibration and selection in unsupervised domain adaptation.
Deep networks prioritize easier examples over harder ones, leading to faster training.
Dance Dance Revolution (DDR) is a popular rhythm-based video game. Players perform steps on a dance platform in synchronization with music as directed by on-screen step charts. While many step charts are available in standardized packs, players may grow tired of existing charts, or wish to dance to a song for which no …