LaMBO optimizes modular systems with switching costs, achieving better results than existing methods.
problem Optimizing systems with costly variable updates in a sequence of modules.
method Lazy Modular Bayesian Optimization (LaMBO) that minimizes switching costs.
result LaMBO achieves vanishing regret and improves over existing cost-aware Bayesian optimization algorithms.
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.
Soft modularization improves sample efficiency and performance in reinforcement learning.
problem Challenges in training multiple tasks jointly in reinforcement learning.
method Explicit modularization technique on policy representation, soft modularization method.
result Improves sample efficiency and performance over strong baselines in robotics manipulation tasks.
The paper develops a new approach to conditional risk measures using modular convex analysis.
problem Developing a new method for conditional risk measures.
method Random modular approach to conditional certainty equivalents and niveloids in the conditional L∞-space. result Retrieves a conditional variational formula for optimized certainty equivalents and applies it to the conditional entropic risk measure.
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.
We simplify modularity optimization using a Ginzburg-Landau functional and an MBO scheme.
problem Modularity optimization in network communities.
method We derive a Ginzburg-Landau functional approximation and an MBO scheme for modularity optimization.
result Our method converges to the correct energy in the limit and is faster and more stable.
Novel convex surrogate for non-modular loss functions.
problem Computational tractability for non-modular loss functions.
method Submodular-supermodular decomposition, slack-rescaling, Lov{á}sz hinge.
result First tractable solution for non-modular loss functions.
BOML unifies meta-learning methods into a common bilevel optimization framework.
problem Meta-learning methods with diverse modeling aspects.
method Modularized bilevel optimization library in Python.
result Unified solution for various meta-learning formulations.
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.
The study examines if ReLU activation function is optimal for modularity in neural networks.
problem Finding the best activation function for modularity in neural networks.
method Comparing ReLU with other activation functions for modularity and performance.
result ReLU may not be the best choice for modularity, suggesting other functions could be more suitable.
Enhances multi-modular models by directing information flow between components.
problem Improving predictive performance in multi-modular models with misspecification.
method Introduces Semi-Modular Inference (SMI) with an influence parameter to control information flow between modules.
result SMI allows for tunable and directed information flow, improving prediction in some settings.
New theory maps neural network weights to optimize faster and scale.
problem Optimizing neural networks for speed and scalability.
method Constructing a duality map using layer-wise operator norms.
result Derived GPU-friendly algorithms for various layers.
Proposes efficient, modular method for implicit differentiation.
problem Implicit differentiation of optimization problems.
method Automatic implicit differentiation using autodiff and implicit function theorem.
result Automatic differentiation of optimization problems is made easier and more modular.
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).
Metareasoning optimizes modular systems by dynamically adjusting configurations.
problem Maximizing system utility in high-stakes tasks with modular subsystems.
method Employing reinforcement learning with rich contextual representations to dynamically adjust module configurations.
result Significant improvement in system performance across various reinforcement learning techniques.
Paper proposes a new unsupervised clustering method using attention models.
problem Unsupervised community detection on graphs.
method Optimizes soft modularity loss on Bethe Hessian embeddings.
result Model performs competitively with classical and GNN methods.
Study on AI-driven modeling for high burnup accident-tolerant fuels in SMRs.
problem Design and optimization of high burnup accident-tolerant fuels for SMRs.
method Artificial intelligence and multi-scale modeling (neutronics, thermal hydraulics, fuel performance).
result Demonstrated the effectiveness of AI in modeling and optimizing SMR fuels.
Analyzes re-ranking diversification algorithms based on function optimization.
problem Improving diversification in ranking systems.
method Examines re-ranking algorithms based on maximizing submodular/modular functions and their optimality in terms of total curvature.
result Adjusting hyperparameters can optimize relevance-diversity trade-offs.
Recursive Feature Machines show grokking in modular arithmetic without neural networks.
problem Grokking in modular arithmetic tasks.
method Recursive Feature Machines (RFM) with Average Gradient Outer Product (AGOP).
result RFM and neural networks learn block-circulant features to solve modular arithmetic.
We present a novel clustering approach for moving object trajectories that are constrained by an underlying road network. The approach builds a similarity graph based on these trajectories then uses modularity-optimization hiearchical graph clustering to regroup trajectories with similar profiles. Our experimental stud…
Modularity-aware GAE and VGAE improve community detection and link prediction.
problem Improving community detection with GAE and VGAE in the absence of node features.
method Introducing a modularity-aware message passing scheme and regularizer to GAE and VGAE encoders.
result Jointly addressing community detection and link prediction with high accuracy is possible.
Greedy algorithms near-optimal for adaptive optimization with budget constraint.
problem Adaptive optimization with budget constraint in AI and ML.
method Investigates two simple greedy algorithms and a combined algorithm for pointwise submodular and cost-sensitive submodular functions.
result Best greedy algorithm is near-optimal with respect to optimal algorithm using half the budget.
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.
SDQL uses modular deep Q networks to efficiently learn multi-stage optimal control tasks.
problem Training complex deep reinforcement learning models for multi-stage control tasks is inefficient and unstable.
method Stacked Deep Q Learning (SDQL) with modular Q networks and backward training.
result SDQL efficiently learns optimal control policies for multi-stage tasks with high-dimensional state and action spaces.
Optimizes group testing for COVID-19 to reduce test numbers.
problem Minimizing tests for accurate infection detection.
method Bayesian approach with genetic algorithms and sub-modularity.
result Greedy-adaptive method provides theoretical guarantees.
ScaML-GP efficiently learns from few meta-tasks using Gaussian processes.
problem Exploiting historical data for quick task solving in low-data regimes.
method Modular Gaussian process model with a carefully designed multi-task kernel.
result ScaML-GP learns efficiently with few and many meta-tasks.
Introduces modular class for Lie algebroids with Nambu structures.
problem Modular classes of Nambu-Poisson manifolds.
method Definition of modular class for Lie algebroids with Nambu structures and properties.
result Properties of modular classes extend to Lie algebroids with Nambu structures.
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.
Sine activation functions enable two-layer neural networks to learn modular addition more efficiently.
problem Learning modular addition with two-layer neural networks.
method Introduced and analyzed sine activation functions, providing theoretical and empirical evidence.
result Sine activation functions allow for constant-width network realizations of modular addition, whereas ReLU networks require linear width scaling.
A new method for fast structure learning with modular regularization.
problem Estimating graphical model structure from high-dimensional and undersampled data.
method A novel method leveraging information-theoretic measures and structured latent factor models to derive an optimization objective encouraging modular structures.
result The proposed method recovers modular structure better as the dimensionality increases and outperforms state-of-the-art estimators at a fraction of the computational cost.
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.
Modularity component analysis clusters data without centering.
problem Clustering data without centering.
method Developed exact linear relation between modularity matrix eigenvectors and singular vectors.
result Modularity component analysis clusters data similarly to PCA but without centering.
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).
The paper computes presentations of cluster modular groups and verifies their generation by Dehn twists.
problem Computing presentations and verifying generation of cluster modular groups.
method A method to compute presentations of saturated cluster modular groups and verification of generation by cluster Dehn twists.
result The cluster modular groups of specified types are virtually generated by cluster Dehn twists.
Convexified modularity maximization for degree-corrected SBMs improves community detection.
problem Stochastic block models assume equal node degrees, but real-world networks often have degree heterogeneity.
method Convex programming relaxation of modularity maximization, followed by a ℓ1-norm k-median procedure. result The method provides theoretical guarantees for clustering accuracy, even in sparse networks.
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…
Defines modular class for symplectic manifolds without coordinates.
problem No specific problem stated; intrinsic description of modular class.
method Coordinate-free intrinsic description of modular class.
result Properties of modular class studied in coordinate-free setting.
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.
mlr3mbo is a modular R toolbox for Bayesian optimization.
problem Efficiently solving optimization problems with multiple objectives and constraints.
method Bayesian optimization with support for multi-objective, multi-point proposals, parallelization, and custom algorithms.
result mlr3mbo performs competitively with state-of-the-art optimizers and robustly handles various optimization regimes.
Simulated Bifurcation outperforms quantum machines in community detection.
problem Community detection in complex networks
method Quantum-inspired Simulated Bifurcation algorithm for QUBO formulation
result Simulated Bifurcation achieves highest modularity in community detection
ResMixNet models learn invariant relational reasoning tasks with fewer parameters.
problem Learning invariant relational reasoning tasks in images with random transformations.
method Introduced Residual Mixture Network (ResMixNet) with a mixture-of-experts architecture.
result ResMixNet models achieve less than 2% test error on MNIST Parity task and less than 1% on colorized Pentomino task.
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.
This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topog…