DAC enhances exploration in reinforcement learning with entropy regularization.
problem Improving exploration efficiency in reinforcement learning.
method Sample-aware entropy regularization using replay buffer action distributions.
result DAC significantly outperforms existing algorithms in reinforcement learning tasks.
Improved exploration in cooperative multi-agent reinforcement learning.
problem Limited expressiveness of Gaussian policies in DecSPG hinders effective exploration.
method Proposes decentralized diffusion policy learning (DDPL) with denoising diffusion probabilistic models.
result Consistently improved performance on various MARL benchmarks.
Quantum RNG improves financial risk metrics estimation.
problem Estimating financial risk metrics with high precision.
method Quantum-Enhanced Monte Carlo using QRNG.
result Improved accuracy in VaR and CVaR estimation.
Enhanced Gaussian process models accelerate optimization and posterior approximation.
problem Improving the accuracy and speed of Gaussian process models for optimization and inference.
method Introduces a random exploration step to classical GP-UCB algorithms, facilitating faster convergence.
result New algorithms achieve nearly optimal convergence rates and provide bounds for Hellinger distance.
Survey of algebraic structures for singular knots.
problem Invariants of singular knots using quandle-like structures.
method Exploration of singquandles, psyquandles, and their invariants.
result Enhancements to the singquandle counting invariant and new polynomial invariants.
Paper explores using EEG for better speaker identification, even in noisy environments.
problem Speaker identification performance degrades in background noise.
method Uses EEG signals to enhance speaker identification systems, comparing with acoustic features.
result Speaker identification system using only EEG features outperforms one using only acoustic features in high background noise.
The paper explores Wiener-Granger causality and its computational enhancements.
problem Analyzing causal relationships between time series data.
method Detailed overview of Granger causality, historical development, and computational advancements.
result Enhanced application of Granger causality in various fields.
Many neural speech enhancement and source separation systems operate in the time-frequency domain. Such models often benefit from making their Short-Time Fourier Transform (STFT) front-ends trainable. In current literature, these are implemented as large Discrete Fourier Transform matrices; which are prohibitively inef…
Improves sample efficiency and generalization in vision-based RL by enhancing exploration.
problem Low sample efficiency in vision-based RL using images as observations.
method Integrates state representation learning to enhance exploration and sample diversity.
result Significant improvement in sample efficiency across various environments.
ETGL-DDPG improves DDPG for sparse reward control with new exploration and replay techniques.
problem Sparse reward continuous control in reinforcement learning.
method Introduces εt-greedy search and GDRB framework for efficient exploration and reward use. result ETGL-DDPG outperforms DDPG and other methods on sparse-reward continuous benchmarks.
This paper explores how RL enhances HFT strategies in volatile markets.
problem Adapting to changing market dynamics in HFT.
method Deep Q-Learning applied to statistical arbitrage strategies.
result RL improves adaptability and profitability in HFT.
The paper explores AI in finance, focusing on XAI's role in enhancing interpretability and trust.
problem The need for AI in finance and the importance of XAI for better decision-making.
method Tracing AI's evolution in finance, highlighting XAI's role, and demonstrating through simulations.
result XAI enhances trust in AI systems, leading to more responsible decision-making.
This paper investigates the effectiveness of adversarial training in enhancing the robustness of Deep Q-Network (DQN) policies to state-space perturbations. We first present a formal analysis of adversarial training in DQN agents and its performance with respect to the proportion of adversarial perturbations to nominal…
Enhanced DQN model boosts trading performance with advanced techniques.
problem Improving automated trading performance in financial markets.
method Incorporation of Prioritized Experience Replay, Regularized Q-Learning, Noisy Networks, Dueling, Double DQN, and CNN architectures.
result Significantly improved returns and Sharpe Ratio compared to the original DQN model.
We explore the question of whether the representations learned by classifiers can be used to enhance the quality of generative models. Our conjecture is that labels correspond to characteristics of natural data which are most salient to humans: identity in faces, objects in images, and utterances in speech. We propose …
Enhances projection pursuit tree classifier with visual diagnostics for better multi-class classification.
problem Rigidity of original algorithm limits performance in complex high-dimensional classification problems.
method Allowing more splits and flexible class groupings in projection pursuit computation, and developing visual diagnostics.
result Demonstrates enhanced classifier performs as intended through interactive visual diagnostics.
Diffusion models enhance speech without supervision.
problem Challenges in generalizing supervised speech enhancement methods to unseen conditions.
method Unsupervised speech enhancement using diffusion-based generative models.
result Demonstrates promising results compared to supervised and unsupervised baselines.
Efficient exploration remains a challenging research problem in reinforcement learning, especially when an environment contains large state spaces, deceptive local optima, or sparse rewards. To tackle this problem, we present a diversity-driven approach for exploration, which can be easily combined with both off- and o…
New AIM algorithm optimizes exploration-exploitation in bandits.
problem Balancing exploration and exploitation in decision-making.
method Approximate Information Maximization (AIM) algorithm.
result AIM outperforms Infomax and Thompson sampling with enhanced speed and tractability.
Enhanced reinforcement learning using ensemble methods.
problem Improving reinforcement learning performance.
method Distributional reinforcement learning with ensemble group-aided training.
result Ensemble methods lead to more robust and efficient learning.
Sheaves on graphs link to noncommutative geometry.
problem Exploring noncommutative geometry concepts on graphs.
method Sheaf theory and simplicial sets.
result Enhanced understanding of discrete noncommutative geometry.
Unified framework for subgraph-enhanced GNNs, improving prediction accuracy and reducing computation time.
problem Limited understanding of subgraph-enhanced GNNs and their relation to the Weisfeiler-Leman hierarchy.
method Theoretical framework, theoretical expressivity results, and data-driven subgraph sampling methods.
result Data-driven subgraph-enhanced GNNs outperform non-data-driven methods in predictive performance.
Two new algorithms improve online clustering of bandits by accelerating cluster identification without strong assumptions.
problem Challenges in accurately identifying unknown user clusters in online bandit settings.
method Proposes UniCLUB and PhaseUniCLUB algorithms with enhanced exploration mechanisms.
result Achieves comparable regret bounds to prior work with weaker assumptions.
Proposes r2SGLD for efficient constrained exploration in non-convex learning.
problem Stagnation in high-temperature chains of reSGLD in distribution tails.
method r2SGLD: replica exchange with reflection steps in a bounded domain.
result Reflection steps enhance mixing rates with quadratic improvement in domain diameter.
Recently deep reinforcement learning (DRL) has achieved outstanding success on solving many difficult and large-scale RL problems. However the high sample cost required for effective learning often makes DRL unaffordable in resource-limited applications. With the aim of improving sample efficiency and learning performa…
A new method improves actor-critic RL by integrating HMC, enhancing policy distribution and exploration.
problem Actor-critic RL yields suboptimal policies due to amortization gap and insufficient exploration.
method Integrating Hamiltonian Monte Carlo (HMC) into the actor-critic RL framework.
result Improves policy distribution and exploration, leading to better policy estimates and higher returns.
Curiosity enhanced by audio-visual associations improves learning efficiency.
problem Challenges in reinforcement learning, especially predicting the future.
method Exploits multiple modalities (audio and vision) to predict novel associations.
result Improves exploration and learning efficiency in various environments.
Enhances BO in high dimensions with Newton methods.
problem Challenges in scaling BO to high-dimensional spaces.
method Construct multiple local quadratic models using gradients and Hessians from a global GP, and select new sample points by solving bound-constrained quadratic programs.
result Outperforms existing high-dimensional BO techniques on synthetic and real-world applications.
This study proposes hidden state curiosity to enhance RL models' resilience against noise.
problem Curiosity traps in RL models distract agents from discovering novel experiences.
method Proposed hidden state curiosity based on the Free Energy Principle to reward agents for KL divergence between predictive priors and posteriors.
result Agents with hidden state curiosity are more resilient against curiosity traps compared to those with prediction error curiosity.
Improving speech system performance in noisy environments remains a challenging task, and speech enhancement (SE) is one of the effective techniques to solve the problem. Motivated by the promising results of generative adversarial networks (GANs) in a variety of image processing tasks, we explore the potential of cond…
PEARL uses reinforcement learning to improve matrix preconditioners.
problem Learning effective preconditioners for iterative solvers is challenging.
method PEARL employs an actor-critic reinforcement learning framework to learn preconditioners dynamically.
result PEARL outperforms traditional and neural preconditioners in flexibility and solving speed.
Generalized complex geometry, introduced by Hitchin, encompasses complex and symplectic geometry as its extremal special cases. We explore the basic properties of this geometry, including its enhanced symmetry group, elliptic deformation theory, relation to Poisson geometry, and local structure theory. We also define a…
This paper reviews ML applications in finance, enhancing asset pricing models.
problem Limitations of traditional asset pricing models in complex market dynamics.
method Exploring ML models including supervised, unsupervised, semi-supervised, and reinforcement learning.
result Enhanced return prediction and portfolio optimization through ML integration.
LES reduces over-exploration in LSO, improving solution quality.
problem Over-exploration in LSO leads to unrealistic solutions.
method LES uses a decoder's approximation of the data distribution to mitigate over-exploration.
result LES enhances solution quality while maintaining high objective values.
Models use embeddings and attention for better claim severity prediction.
problem Improving predictive modeling of claim severity with categorical data.
method Developed neural networks and attention-based architectures with embeddings.
result Attention-based models enhance predictive performance with contextual augmentation.
Proposes a method to enhance exploration in RL using temporal difference uncertainties.
problem Challenges in estimating uncertainty in non-tabular reinforcement learning settings.
method Estimates uncertainty over value function using temporal difference errors and incorporates it as an intrinsic reward.
result Demonstrates improved exploration in various tasks, including Deep Sea and Atari 2600 environments.
We explore a novel approach to semi-supervised learning. This approach is contrary to the common approach in that the unlabeled examples serve to "muffle," rather than enhance, the guidance provided by the labeled examples. We provide several variants of the basic algorithm and show experimentally that they can achieve…
RL enhances LLM planning but introduces spurious solutions and diversity collapse.
problem Theoretical understanding of RL's benefits and limitations in LLM planning.
method Graph-based abstraction, policy gradient, Q-learning, supervised fine-tuning.
result RL's exploration is crucial for generalization, but PG suffers from diversity collapse.
Graph attention networks improve performance on heterogeneous graphs.
problem Complex performance of GNNs on heterogeneous graphs.
method Integrating positional encodings into graph attention networks.
result Graph attention networks excel in node classification and link prediction.
Improved speech enhancement with MNTFA using time-frequency attention.
problem Speech enhancement with limited model size and memory.
method Designing MNTFA with self-attention modules for long sequences and joint training.
result MNTFA achieves better performance with fewer parameters than DPCRN.
AGAC uses an adversary to enhance exploration in complex tasks.
problem Sample inefficiency in complex environments, especially in tasks requiring efficient exploration.
method Integrates an adversary into the actor-critic framework to encourage innovative exploration strategies.
result AGAC leads to more exhaustive exploration and outperforms state-of-the-art methods.
Rescaling expansiveness proven for k*-expansive vector fields.
problem Proving rescaling expansiveness for k*-expansive vector fields.
method Introducing and exploring singular-expansive flows.
result Rescaling expansiveness established for k*-expansive vector fields.
Enhances time-series modeling by dropping patches, improving efficiency and adaptability.
problem Improving masked time-series modeling efficiency and adaptability.
method DropPatch method, which randomly drops sub-sequence level patches.
result DropPatch improves pre-training efficiency and adaptability in various learning scenarios.
BERTopic enhances stock market prediction by analyzing sentiment in topic models.
problem Improving stock price prediction accuracy using sentiment analysis.
method Employed BERTopic for sentiment analysis of stock market comments integrated with deep learning models.
result Enhanced model performance through topic sentiment integration.
Quantum algorithms can enhance machine learning in different aspects. Here, we study quantum-enhanced least-square support vector machine (LS-SVM). Firstly, a novel quantum algorithm that uses continuous variable to assist matrix inversion is introduced to simplify the algorithm for quantum LS-SVM, while retaining expo…
Study uses big data to analyze quantum invariants.
problem Investigate structural properties of Jones polynomial.
method Exploratory and topological data analysis, including coloring, rank increase, categorification.
result Contrasts behavior of Jones polynomial under various enhancements.
AER dynamically adjusts entropy regularization for better LLM reinforcement learning.
problem Policy entropy collapse in RLVR training limits exploration and reasoning performance.
method Adaptive Entropy Regularization (AER) with difficulty-aware coefficient allocation, initial-anchored target entropy, and dynamic global coefficient adjustment.
result AER consistently outperforms baselines on mathematical reasoning benchmarks, improving both accuracy and exploration.
Model-free reinforcement learning algorithms such as Deep Deterministic Policy Gradient (DDPG) often require additional exploration strategies, especially if the actor is of deterministic nature. This work evaluates the use of model-based trajectory optimization methods used for exploration in Deep Deterministic Policy…