Statistical Linkage Learning enables a new mask construction algorithm for Partition Crossover that maintains effectiveness on noisy problems with hidden dependencies and matches noise-free performance when decomposition quality is high.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
verdicts
UNVERDICTED 6representative citing papers
Asynchronous execution yields 2.9x-16.9x speedups across Jacobi, value iteration, and SCF methods; Anderson acceleration succeeds only under evaluation-level perturbation, not iterate-level corruption.
LyMPuS is a parameterless on-the-fly surrogate enabling perfect monotonic comparisons and guaranteed linkage discovery in at most 2 log n steps for non-linear problems.
Composing a policy that maps 2D waypoints to joint actions with a frozen world model yields a lifted world model that achieves 3.8 times lower mean joint error than direct low-level search while being more compute-efficient and generalizing to unseen environments.
Two-step pessimistic Virtual Gap Analysis via linear programming ranks alternatives with cardinal and ordinal data to identify and remove the weakest option.
Connects Lyapunov control theory to a provable defense against weaker adversarial attacks on neural networks.
citing papers explorer
-
Obtaining Partition Crossover masks using Statistical Linkage Learning for solving noised optimization problems with hidden variable dependency structure
Statistical Linkage Learning enables a new mask construction algorithm for Partition Crossover that maintains effectiveness on noisy problems with hidden dependencies and matches noise-free performance when decomposition quality is high.
-
Fault Tolerance of Accelerated Asynchronous Fixed-Point Iterations on Flexible Computing Infrastructure
Asynchronous execution yields 2.9x-16.9x speedups across Jacobi, value iteration, and SCF methods; Anderson acceleration succeeds only under evaluation-level perturbation, not iterate-level corruption.
-
Limited Perfect Monotonical Surrogates constructed using low-cost recursive linkage discovery with guaranteed output
LyMPuS is a parameterless on-the-fly surrogate enabling perfect monotonic comparisons and guaranteed linkage discovery in at most 2 log n steps for non-linear problems.
-
Lifting Embodied World Models for Planning and Control
Composing a policy that maps 2D waypoints to joint actions with a frozen world model yields a lifted world model that achieves 3.8 times lower mean joint error than direct low-level search while being more compute-efficient and generalizing to unseen environments.
-
Linear Programming for Multi-Criteria Assessment with Cardinal and Ordinal Data: A Pessimistic Virtual Gap Analysis
Two-step pessimistic Virtual Gap Analysis via linear programming ranks alternatives with cardinal and ordinal data to identify and remove the weakest option.
-
Connecting Lyapunov Control Theory to Adversarial Attacks
Connects Lyapunov control theory to a provable defense against weaker adversarial attacks on neural networks.