A modular GP framework for efficient transfer learning.
problem Efficiently transfer knowledge across different tasks or datasets.
method Modular variational Gaussian processes (GPs) with a dictionary of well-fitted GPs.
result Reduces computational costs and allows the transfer of uncertainty metrics.
PICLE uses probabilistic models to efficiently evaluate and compose modules for continual learning.
problem Challenging search space of module compositions in continual learning.
method Probabilistic framework to cheaply compute module compositions' fitness.
result First modular CL algorithm to achieve perceptual, few-shot, and latent transfer.
The study shows how modular learning can adapt to new tasks.
problem Adapting to new tasks in an ever-changing environment.
method Task segmentation, modular learning, memory-based ensembling.
result The system demonstrates robustness to catastrophic forgetting and increasing positive transfer.
Modular deep learning framework using pairwise labels without backpropagation.
problem Efficiently training deep neural networks with limited supervision.
method Stacked linear models in feature spaces, provably optimal modular learning framework.
result High accuracy (94.88%) achieved with minimal labeled examples (1 per class).
Survey of methods to train deep architectures without E2EBP.
problem Training deep architectures without end-to-end backpropagation.
method Modular training, weakly modular hybrids.
result Provably optimal alternatives to E2EBP can match or surpass E2EBP performance.
New framework for modular reinforcement learning reduces sample complexity.
problem Achieving independent credit assignment in reinforcement learning.
method Defining modular credit assignment as minimizing algorithmic mutual information, introducing modularity criterion for causal analysis.
result Single-step temporal difference action-value methods meet the modularity criterion, improving sample efficiency.
End-to-end optimization has achieved state-of-the-art performance on many specific problems, but there is no straight-forward way to combine pretrained models for new problems. Here, we explore improving modularity by learning a post-hoc interface between two existing models to solve a new task. Specifically, we take i…
PALM learns abstract models for efficient planning and task transfer.
problem Efficiently learning and transferring hierarchical models for planning.
method PALM uses a new formal structure (L-AMDP) to learn independent, modular models at multiple levels of abstraction.
result PALM integrates planning and execution, facilitating rapid learning of abstract models.
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.
Unified approach to conformal and modular invariants on surfaces.
problem Constructing a general family of conformal invariants on surfaces.
method Using an identification of Teichmüller space and rigged moduli space, and analytic work on harmonic functions.
result Unified conformal and modular invariants can be viewed as generalized modular invariants and functions on the rigged moduli space.
Transfer and adaptation to new unknown environmental dynamics is a key challenge for reinforcement learning (RL). An even greater challenge is performing near-optimally in a single attempt at test time, possibly without access to dense rewards, which is not addressed by current methods that require multiple experience …
Modular method predicts motion in crowded scenes using learned environment models.
problem Predicting motion in dynamic, crowded environments.
method Modular model of spatial and dynamic aspects, unsupervised adaptation to new tasks.
result Comparable performance to state-of-the-art, transferable across tasks.
As reinforcement learning agents are tasked with solving more challenging and diverse tasks, the ability to incorporate prior knowledge into the learning system and to exploit reusable structure in solution space is likely to become increasingly important. The KL-regularized expected reward objective constitutes one po…
Recent efforts on training visual navigation agents conditioned on language using deep reinforcement learning have been successful in learning policies for different multimodal tasks, such as semantic goal navigation and embodied question answering. In this paper, we propose a multitask model capable of jointly learnin…
Deep generative models can emulate the perceptual properties of complex image datasets, providing a latent representation of the data. However, manipulating such representation to perform meaningful and controllable transformations in the data space remains challenging without some form of supervision. While previous w…
This paper explores how imperfect reward models can improve online RLHF.
problem Sample efficiency in online RLHF from imperfect reward models.
method Identifies policy coverability and proposes TPO algorithm for transfer learning.
result TPO algorithm improves sample efficiency compared to standard online learning.
New smart contract mechanisms evade traditional AML systems by decoupling transaction roles.
problem Current AML systems fail to track economic value migration in composable smart contracts.
method Introduce PEB separation and state-mediated value migration to demonstrate how traditional tracing fails.
result Transfer-layer observation is incomplete and causally ambiguous in composable smart contracts.
SX-GeoTree improves spatially coherent explanations in geospatial regression trees.
problem Capturing spatial dependence and producing robust explanations in tabular prediction models.
method Integrates three objectives: impurity reduction, spatial residual control, and explanation robustness via modularity maximization on a consensus similarity network.
result Improves residual spatial evenness and doubles attribution consensus (modularity: Fujian 0.19 vs 0.09; Seattle 0.10 vs 0.05).
Objective The electrical characteristics of the EEG signals can be used for seizure detection. Statistical independence between different brain regions is measured by functional brain connectivity (FBC). Specific directional effects can't consider by FBC and thus effective brain connectivity (EBC) is used to measure ca…
BNNs enhance reservoir computing by acting as generalization filters.
problem Understanding how BNNs integrate with reservoir computing.
method Optogenetics and calcium imaging to record BNNs, reservoir computing framework.
result BNNs improve reservoir computing performance through generalization.
In the quest for efficient and robust reinforcement learning methods, both model-free and model-based approaches offer advantages. In this paper we propose a new way of explicitly bridging both approaches via a shared low-dimensional learned encoding of the environment, meant to capture summarizing abstractions. We sho…
We find and propose an explanation for a large variety of modularity-related symmetries in problems of 3-manifold topology and physics of 3d N=2 theories where such structures a priori are not manifest. These modular structures include: mock modular forms, SL(2,Z) Weil representations, quantum mo…
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.
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).
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…
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…
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.
New formulas derived for anomaly cancellation using modular forms and E8 bundles.
problem Anomaly cancellation in odd dimensions.
method Systematic twisting and generalization of SL(2,Z) modular forms to define new forms associated with E8 and E8*E8 bundles.
result Derivation of a new series of anomaly cancellation formulas.
ETQFTs created from non-semisimple modular categories.
problem Constructing ETQFTs from non-semisimple modular categories.
method Explicitly identify linear categories and functors in the image of ETQFTs constructed from modular categories.
result The circle category of ETQFTs is equivalent to the full subcategory of projective objects of the underlying modular category, which need not be semisimple.
We study the behavior of the modular class of a Lie algebroid under general Lie algebroid morphisms by introducing the relative modular class. We investigate the modular classes of pull-back morphisms and of base-preserving morphisms associated to Lie algebroid extensions. We also define generalized morphisms, includin…
We introduce the modular class of a Poisson map. We look at several examples and we use the modular classes of Poisson maps to study the behavior of the modular class of a Poisson manifold under different kinds of reduction. We also discuss their symplectic groupoid version, which lives in groupoid cohomology.