cs.NE

Papers

• Scalable and Sustainable Deep Learning via Randomized Hashing (2016)
  Ryan Spring et al.
  —
• Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem (2016)
  Mohamed El Yafrani and Bela\"id Ahiod
  —
• CMA-ES for Hyperparameter Optimization of Deep Neural Networks (2016)
  Ilya Loshchilov and Frank Hutter
  —
• Distributed Evolutionary k-way Node Separators (2017)
  Peter Sanders et al.
  —
• Deep Learning for Explicitly Modeling Optimization Landscapes (2017)
  Shumeet Baluja
  —
• Probabilistic Tools for the Analysis of Randomized Optimization Heuristics (2021)
  Benjamin Doerr
  —
• AEkNN: An AutoEncoder kNN-based classifier with built-in dimensionality reduction (2018)
  Francisco J. Pulgar et al.
  —
• Review: Metaheuristic Search-Based Fuzzy Clustering Algorithms (2018)
  Waleed Alomoush et al.
  —
• Parallel Architecture and Hyperparameter Search via Successive Halving and Classification (2018)
  Manoj Kumar et al.
  —
• LDW-SCSA: Logistic Dynamic Weight based Sine Cosine Search Algorithm for Numerical Functions Optimization (2018)
  Turker Tuncer
  —
• You Only Search Once: Single Shot Neural Architecture Search via Direct Sparse Optimization (2018)
  Xinbang Zhang et al.
  —
• Creative AI Through Evolutionary Computation (2020)
  Risto Miikkulainen
  —
• Stochastic Optimization of Sorting Networks via Continuous Relaxations (2019)
  Aditya Grover et al.
  —
• Parabolic Approximation Line Search for DNNs (2021)
  Maximus Mutschler and Andreas Zell
  —
• Efficient Feature Selection of Power Quality Events using Two Dimensional (2D) Particle Swarms (2019)
  Faizal Hafiz and Akshya Swain and Chirag Naik and Nitish Patel
  —
• Steepest ascent can be exponential in bounded treewidth problems (2020)
  David A. Cohen et al.
  —
• Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS (2019)
  Petro Liashchynskyi and Pavlo Liashchynskyi
  —
• Variance Reduction for Better Sampling in Continuous Domains (2020)
  Laurent Meunier et al.
  —
• Angle-based Search Space Shrinking for Neural Architecture Search (2020)
  Yiming Hu et al.
  —
• Atom Search Optimization with Simulated Annealing -- a Hybrid Metaheuristic Approach for Feature Selection (2020)
  Kushal Kanti Ghosh et al.
  —
• V3H: View Variation and View Heredity for Incomplete Multi-view Clustering (2026)
  Xiang Fang et al.
  —
• ES-ENAS: Efficient Evolutionary Optimization for Large Hybrid Search Spaces (2023)
  Xingyou Song et al.
  —
• BR-NS: an Archive-less Approach to Novelty Search (2021)
  Achkan Salehi et al.
  —
• DEHB: Evolutionary Hyperband for Scalable, Robust and Efficient Hyperparameter Optimization (2021)
  Noor Awad et al.
  —
• GSGP-CUDA -- a CUDA framework for Geometric Semantic Genetic Programming (2021)
  Leonardo Trujillo et al.
  —
• Hash-Based Tree Similarity and Simplification in Genetic Programming for Symbolic Regression (2021)
  Bogdan Burlacu et al.
  —
• RepNAS: Searching for Efficient Re-parameterizing Blocks (2022)
  Mingyang Zhang et al.
  —
• Orthogonal Matrices for MBAT Vector Symbolic Architectures, and a "Soft" VSA Representation for JSON (2022)
  Stephen I. Gallant
  —
• SpiderNet: Hybrid Differentiable-Evolutionary Architecture Search via Train-Free Metrics (2022)
  Rob Geada et al.
  —
• Tensor Shape Search for Optimum Data Compression (2022)
  Ryan Solgi et al.
  —
• Braid-based architecture search (2022)
  Olga Lukyanova and Oleg Nikitin and Alex Kunin
  —
• Unified Functional Hashing in Automatic Machine Learning (2023)
  Ryan Gillard et al.
  —
• Refining a $k$-nearest neighbor graph for a computationally efficient spectral clustering (2023)
  Mashaan Alshammari et al.
  —
• Density Descent for Diversity Optimization (2024)
  David H. Lee et al.
  —
• Bridging Evolutionary Algorithms and Reinforcement Learning: A Comprehensive Survey on Hybrid Algorithms (2026)
  Pengyi Li et al.
  —
• The Runtime of Random Local Search on the Generalized Needle Problem (2025)
  Benjamin Doerr et al.
  —
• Random Search as a Baseline for Sparse Neural Network Architecture Search (2024)
  Rezsa Farahani
  —
• Local search for valued constraint satisfaction parameterized by treedepth (2024)
  Artem Kaznatcheev
  —
• Dynamic Dimension Wrapping (DDW) Algorithm: A Novel Approach for Efficient Cross-Dimensional Search in Dynamic Multidimensional Spaces (2024)
  Dongnan Jin et al.
  —
• Document clustering with evolved multiword search queries (2025)
  Laurence Hirsch et al.
  —
• Plan for Speed: Dilated Scheduling for Masked Diffusion Language Models (2026)
  Omer Luxembourg et al.
  —
• CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimization (2026)
  Henrique Assump\c{c}\~ao et al.
  —
• Smart Timing for Mining: A Deep Learning Framework for Bitcoin Hardware ROI Prediction (2026)
  Sithumi Wickramasinghe et al.
  —
• On the Infinite Width and Depth Limits of Predictive Coding Networks (2026)
  Francesco Innocenti et al.
  —
• Muscle Synergy Priors Enhance Biomechanical Fidelity in Predictive Musculoskeletal Locomotion Simulation (2026)
  Ilseung Park (Carnegie Mellon University) et al.
  —
• Architecture-Induced Recoverability Bias in Differentiable Symbolic Regression (2026)
  Chakshu Gupta et al.
  —
• Mechanistic Interpretability of EEG Foundation Models via Sparse Autoencoders (2026)
  William Lehn-Schi{\o}ler et al.
  —
• Preisach Attention: A Hysteretic Model of Sequential Memory (2026)
  Piotr Frydrych
  —
• In Search of the Ingredients of Open-Endedness: Replicating Picbreeder with Large Vision-Language Models (2026)
  Sam Earle et al.
  —
• Convex-Neural RRT*: Fast and Reliable Learning-Guided Sampling for High-Quality Robot Path Planning (2026)
  Hichem Cheriet et al.
  —