Modular RL modules solve complex 3D Sokoban tasks.
problem Solving complex, integrated tasks combining visual, physical, and abstract reasoning.
method Compose RL modules in a sense-plan-act hierarchy, using only model-free methods.
result Modular RL outperforms state-of-the-art monolithic RL on Mujoban.
SLM Lab is a framework for reproducible RL research with modular algorithms.
problem Reproducibility in deep reinforcement learning.
method Modular software framework for RL algorithms, synchronous/asynchronous execution, hyperparameter search, result analysis.
result Comprehensive benchmark and novel RL algorithms (e.g., discrete-AC variant, hybrid training method).
RLgraph separates RL tasks into modular components for stability and efficiency.
problem Algorithmic instability, hyper-parameter sensitivity, and distributed communication patterns in RL tasks.
method Introduces RLgraph, a library for RL tasks in static and define-by-run paradigms.
result Robust, testable, and high-performance implementations across different frameworks and backends.
New framework learns robot tasks quickly from simplified simulations.
problem Long training times and variable-length inputs in RL.
method Combines deep sets encoding with modular RL.
result Effective policies learned in minutes from simplified simulations.
MSPM uses modular agents to manage financial portfolios efficiently.
problem Scalability and reusability issues in RL-based financial portfolio management.
method Modular design with Evolving Agent Module (EAM) and Strategic Agent Module (SAM).
result MSPM improves profit accumulation by at least 186.5% compared to CRP.
A reinforcement learning framework for Mars rover control using temporal logic.
problem Sparse rewards in continuous-state continuous-action MDPs with high-level temporal structures.
method Actor-critic, model-free, online RL framework with modular DDPG architecture.
result Success rate of synthesised policy in Mars rover experiment.
A network of spiking agents learns complex tasks using global reward signals.
problem Solving complex reinforcement learning tasks.
method A hierarchical network of GLM spiking agents, each modulating its firing policy based on local and global reward signals.
result A network of spiking agents can learn complex action representations to solve RL tasks.
Unified policy controls diverse agents through modular neural networks.
problem Learning control policies for various agent morphologies.
method Shared Modular Policies (SMP) with decentralized control and message passing.
result A single modular policy controls multiple agent morphologies.
MOReL learns offline RL policies using pessimistic MDPs.
problem Offline RL's data efficiency and velocity.
method Two-step process: learn P-MDP and near-optimal policy in it.
result MOReL is minimax optimal and matches state-of-the-art results.
Unified framework for reliable uncertainty quantification in RL.
problem Uncertainty quantification in high-stakes reinforcement learning.
method Unified conformal prediction framework integrating distributional RL and conformal calibration.
result Significantly improved coverage and reliability over standard methods.
RL algorithm optimizes jet grooming for collider experiments.
problem Improving jet mass resolution in boosted objects.
method Deep RL agent trained on signal and background samples.
result RL-derived grooming algorithm matches state-of-the-art techniques.
ReSkill reconciles RL skill creation with policy optimization.
problem RL policies lack reusable strategies across tasks.
method Integrates skill creation into RL loop with three mechanisms.
result Consistently outperforms existing methods, especially on unseen tasks.
Paper presents a modular RL framework for Forex trading, addressing limitations of prior studies.
problem Challenges in applying RL to Forex trading, including unrealistic environments, simplified rewards, and restricted action spaces.
method Integrates three components: a friction-aware execution engine, a decomposable reward architecture, and a discrete action interface.
result Empirical evaluation shows strong non-monotonic reward interactions and optimal Sharpe ratio with the full reward configuration.
New RL environments help AI learn causal relationships from visual data.
problem Learning causal relationships from visual data for AI agents.
method Designing benchmark RL environments and evaluating representation learning algorithms.
result Explicitly incorporating structure and modularity improves causal induction in model-based RL.
DARLING tackles non-stationary RL with guarantees, improving dynamic regret.
problem Non-stationary reinforcement learning in unknown change points.
method Detection Augmented Reinforcement Learning (DARLING) for tabular and linear MDPs.
result DARLING matches minimax lower bounds in tabular and linear MDPs.
Single episode policy transfer in RL without access to rewards.
problem Performing near-optimally in a single attempt with unknown dynamics.
method Optimizes a probe and inference model to estimate latent variables for universal control policy.
result Significantly outperforms existing adaptive approaches in diverse domains.
HiDe learns hierarchical control for complex tasks by separating planning and control.
problem Solving long horizon control tasks with generalization to unseen scenarios.
method Functional decomposition of state-action spaces, RL-based planner, modular transfer of policy layers.
result Generalizes across unseen test environments and scales to longer horizons.
Study shows offline RL under Q⋆-approximation and partial coverage is harder than previously thought.
problem Theoretical limits of offline reinforcement learning under Q⋆-approximation and partial coverage. method Introduced a decision-estimation framework to decompose offline RL complexity into decision and value estimation errors.
result Answered the open question by proving sample inefficiency under partial coverage is not guaranteed by Q⋆-realizability and Bellman completeness. This work argues for the importance of objects in model-based reinforcement learning.
problem Dynamic construction of models in real-world problems.
method Identifies requirements for overcoming limitations in connectionist models.
result Objects are essential for dynamic model construction in reinforcement learning.
Platform combines RL and language models to study narrative influence on AI decisions.
problem Understanding how narrative elements shape AI decision-making.
method Dual-system architecture with reinforcement learning and language model integration.
result Initial experiments show narrative frameworks can influence AI decision-making.
Discoveries new symmetries in 3d topological and physical systems.
problem Identifying hidden symmetries in 3d topological and physical systems.
method Analysis of modular forms, Weil representations, and chiral algebras.
result Identification of new modular structures in 3d theories.
Baconian simplifies MBRL experiments by providing a flexible framework.
problem Lack of reusable open-source frameworks for MBRL research.
method Developed a flexible and modularized framework, Baconian.
result Facilitates MBRL experiments by allowing customization and reuse of algorithms.
Researchers found the global topology of the Eisenstein-Picard modular surface.
problem Understanding the global topology of the Eisenstein-Picard modular surface.
method Quotient space of the complex hyperbolic plane by the modular group.
result Determined the global topology of the Eisenstein-Picard modular surface as a 4-orbifold.
Study modular surfaces in Lorentz-Minkowski 3-space, classifying and analyzing their curvature and applications.
problem Understanding the curvature properties of modular surfaces in Lorentz-Minkowski space.
method Analyzing the sign of Gaussian and mean curvature, classifying surfaces, and applying to conformal field theories.
result Complete classification of zero Gaussian curvature modular surfaces and non-existence of non-planar maximal modular surfaces.
Modular neural networks generalize better with less data.
problem Theoretical and practical understanding of how modularity improves neural network generalization.
method Theoretical analysis of sample complexity, development of a novel learning rule.
result Modular networks require fewer samples to generalize compared to nonmodular networks, especially in high-dimensional tasks.
This review establishes a taxonomy for modular neural networks.
problem Scaling ANNs for complex and multi-disciplinary problems.
method Systematic analysis of modularization techniques in MNNs.
result A universal framework for studying MNNs.
Study modular forms over Γ^0(2) and anomaly cancellation formulas.
problem Anomaly cancellation formulas for modular forms over Γ^0(2).
method Study and analysis of modular forms over Γ^0(2).
result Anomaly cancellation formulas derived for modular forms over Γ^0(2).
Deep RL predicts car steering angles from images.
problem Learning steering angles for autonomous cars in simulators.
method Extracts latent representations, trains RL on latent vectors.
result Method learns steering angles without human control signals.
Our aim is to introduce and advocate non-Σ (non-symmetric) modular operads. While ordinary modular operads were inspired by the structure of the moduli space of stable complex curves, non-Σ modular operads model surfaces with open strings outputs. An immediate application of our theory is a short proof that the mod…
WiseMove framework for safe deep RL in autonomous driving.
problem Ensuring safety in deep reinforcement learning for autonomous driving.
method Modular learning architecture for motion planning.
result Demonstrated on a common traffic scenario, WiseMove supports safe learning.
Neural networks learn modular arithmetic but not all, extending known solutions to generalize.
problem Neural networks struggle with modular arithmetic, especially for polynomials.
method Developed analytical solutions for MLP networks to learn modular addition and multiplication, then combined these solutions to generalize on arbitrary modular polynomials.
result Neural networks can learn and generalize solutions to modular polynomials, supporting the hypothesis that some polynomials are learnable.
Fuchsian groups with a modular embedding have the richest arithmetic properties among non-arithmetic Fuchsian groups. But they are very rare, all known examples being related either to triangle groups or to Teichmueller curves. In Part I of this paper we study the arithmetic properties of the modular embedding and deve…
Modular NNs improve training speed and stability.
problem Complexity in NNs with many parameters or intricate architectures.
method Decompose NN into control and functional modules.
result Modular NNs outperform monolithic ones in training speed and stability.
Improved algorithm for modular links provides upper volume bounds.
problem Understanding the geometry of modular links and Lorenz links.
method Bunch algorithm to study modular links and provide upper volume bounds.
result First upper volume bound independent of word exponents and quadratic in braid index.
Geodesics on modular surface yield arithmetic 3-manifolds.
problem Understanding arithmetic properties of modular surfaces.
method Constructing geodesics and analyzing their lifts.
result Complements of canonical lifts are arithmetic 3-manifolds.
We introduce the notion of the modular class of a Lie algebroid equipped with a Nambu structure. In particular, we recover the modular class of a Nambu-Poisson manifold M with its Nambu tensor Λ as the modular class of the tangent Lie algebroid TM with Nambu structure Λ. We show that many known properties of th…
New modular forms for anomaly cancellation formulas on any dimensional manifolds.
problem Constructing new modular forms for anomaly cancellation formulas.
method Using E8 bundles, constructing modular forms on any dimensional manifolds. result Derived new anomaly cancellation formulas and applications.
Quantum modularity proved for SU(2) TQFT signature on genus 2 surfaces.
problem Proving quantum modularity of SU(2) TQFT signature for genus 2 surfaces.
method Using quantum modularity of generalized Dedekind sums associated with modular forms and trigonometric sum expressions.
result Quantum modularity of SU(2) TQFT signature on genus 2 surfaces proved.
Motivated by a question of Hirzebruch on the possible topological types of cusp cross-sections of Hilbert modular varieties, we give a necessary and sufficient condition for a manifold M to be diffeomorphic to a cusp cross-section of a Hilbert modular variety. Specialized to Hilbert modular surfaces, this proves that e…
Countable modular groups found on surfaces with infinite type.
problem Finding modular groups of infinite type surfaces.
method Proving countable modular groups for orientable infinite type surfaces.
result Every orientable infinite type surface has a countable modular group.
Quantum modularity proven for specific theta series.
problem Proving quantum modularity for partial theta series with periodic coefficients.
method Explicit proof using Kontsevich-Zagier series and colored Jones polynomials.
result Kontsevich-Zagier series is a weight 3/2 quantum modular form.
Study Alexander polynomials of modular knots, revealing finite and infinite coefficient properties.
problem Investigate Alexander polynomials of modular knots.
method Use Burau representation and geometric SL2(Z)-invariants. result Alexander polynomials of modular knots have both finite and infinite coefficient properties.
The paper introduces elliptic quasi-modular forms via moduli spaces.
problem Developing a theory of elliptic quasi-modular forms.
method Using moduli spaces and the Gauss-Manin connection.
result Presented a succinct theory of elliptic quasi-modular forms.
In this paper the exact linear relation between the leading eigenvectors of the modularity matrix and the singular vectors of an uncentered data matrix is developed. Based on this analysis the concept of a modularity component is defined, and its properties are developed. It is shown that modularity component analysis …
Sharp lower bounds for modular invariants and Dehn twist coefficients in genus 2 and 3.
problem Finding sharp lower bounds for modular invariants and Dehn twist coefficients.
method Analyzing the relation between fractional Dehn twists and modular invariants, classifying pseudo-periodic maps, and proving rigidity properties.
result Sharp lower bounds for modular invariants and Dehn twist coefficients in genus 2 and 3.
This paper develops the exact linear relationship between the leading eigenvector of the unnormalized modularity matrix and the eigenvectors of the adjacency matrix. We propose a method for approximating the leading eigenvector of the modularity matrix, and we derive the error of the approximation. There is also a comp…
Constructs modular forms and proves divisibility results for odd-dimensional manifolds.
problem Constructing modular forms over specific groups and proving divisibility results.
method SL(2, Z) modular forms and Witten genus in odd dimensions.
result Obtained divisibility results of index of Toeplitz operators on spin and spin^c manifolds.
A modular functor is constructed from non-semisimple 3d TFTs.
problem Constructing modular functors from non-semisimple 3d topological field theories.
method Using a 3d TFT defined in [arXiv:1912.02063], a symmetric monoidal 2-functor is constructed from a 2-category of bordisms to a 2-category of finite linear categories.
result A modular functor is explicitly described as a symmetric monoidal 2-functor.