NeuroPareto: Calibrated Acquisition for Costly Many-Goal Search in Vast Parameter Spaces

• URL: http://arxiv.org/abs/2602.03901v1
• Date: Tue, 03 Feb 2026 10:02:06 GMT
• Title: NeuroPareto: Calibrated Acquisition for Costly Many-Goal Search in Vast Parameter Spaces
• Abstract summary: NeuroPareto is a cohesive architecture that integrates rank-centric filtering, uncertainty disentanglement, and history-conditioned acquisition strategies.<n>A lightweight acquisition network, trained online from historical hypervolume improvements, guides expensive evaluations toward regions balancing convergence and diversity.
• Score: 13.246738608273711
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The pursuit of optimal trade-offs in high-dimensional search spaces under stringent computational constraints poses a fundamental challenge for contemporary multi-objective optimization. We develop NeuroPareto, a cohesive architecture that integrates rank-centric filtering, uncertainty disentanglement, and history-conditioned acquisition strategies to navigate complex objective landscapes. A calibrated Bayesian classifier estimates epistemic uncertainty across non-domination tiers, enabling rapid generation of high-quality candidates with minimal evaluation cost. Deep Gaussian Process surrogates further separate predictive uncertainty into reducible and irreducible components, providing refined predictive means and risk-aware signals for downstream selection. A lightweight acquisition network, trained online from historical hypervolume improvements, guides expensive evaluations toward regions balancing convergence and diversity. With hierarchical screening and amortized surrogate updates, the method maintains accuracy while keeping computational overhead low. Experiments on DTLZ and ZDT suites and a subsurface energy extraction task show that NeuroPareto consistently outperforms classifier-enhanced and surrogate-assisted baselines in Pareto proximity and hypervolume.

Related papers

• No Unique Minimizer, No Problem: On the Consistency of Robust Neural Classifiers [5.257368647985538]
  We develop a consistency theory for robust neural classifiers based on the S-divergence family.<n>We prove that empirical S-divergence minimizers converge to the population-optimal equivalence class under mild regularity conditions.<n>Experiments on vision and language benchmark datasets confirm that S-divergence training maintains clean-data accuracy while exhibiting performance competitive with existing robust methods.
  arXiv  Detail & Related papers  (2026-08-09T05:21:08Z)
• Multi-Head Attention-Based Feature Extractor Integration with Soft Actor-Critic for Porosity Prediction and Process Parameter Optimization in Additive Manufacturing [0.0]
  Traditional reinforcement learning approaches suffer from slow convergence and susceptibility to local optima.<n>This study addresses these limitations by employing a continuous action space combined with a novel architecture.<n>The proposed methodology achieves a convergence value of 322.79 within 14 episodes, outperforming existing approaches.
  arXiv  Detail & Related papers  (2026-06-18T11:07:36Z)
• ODAR: Principled Adaptive Routing for LLM Reasoning via Active Inference [60.958331943869126]
  ODAR-Expert is an adaptive routing framework that optimize the accuracy-efficiency trade-off via principled resource allocation.<n>We show strong and consistent gains, including 98.2% accuracy on MATH and 54.8% on Humanity's Last Exam.
  arXiv  Detail & Related papers  (2026-02-27T05:22:01Z)
• High-Probability Minimax Adaptive Estimation in Besov Spaces via Online-to-Batch [8.691764858459623]
  We study nonparametric regression over Besov spaces from noisy observations under sub-exponential noise.<n>We propose a wavelet-based online learning algorithm that dynamically adjusts to the observed gradient noise by adaptively clipping it at an appropriate level.<n>We obtain adaptive and minimax-optimal estimation rates for Besov spaces via a refined online-to-batch conversion.
  arXiv  Detail & Related papers  (2026-02-12T09:24:08Z)
• Tensor-Efficient High-Dimensional Q-learning [4.503747347543387]
  High-dimensional reinforcement learning faces challenges with complex calculations and low sample efficiency in large state-action spaces.<n>We propose TEQL, which enhances low-rank tensor decomposition via improved block coordinate descent on discretized state-action spaces.<n>Key innovation is an exploration strategy that combines approximation error with visit count-based upper confidence bound to prioritize actions with high uncertainty.
  arXiv  Detail & Related papers  (2025-11-05T16:16:31Z)
• HYPERDOA: Robust and Efficient DoA Estimation using Hyperdimensional Computing [8.27483835715597]
  We introduce HYPERDOA, a novel estimator leveraging Hyperdimensional Computing (HDC)<n>It achieves 35.39% higher accuracy than state-of-the-art methods in low-SNR, coherent-source scenarios.<n>It also consumes 93% less energy than competing neural baselines on an embedded NVIDIA Jetson Xavier NX platform.
  arXiv  Detail & Related papers  (2025-10-12T17:42:01Z)
• Deep Gaussian Process-based Cost-Aware Batch Bayesian Optimization for Complex Materials Design Campaigns [0.6740600601012572]
  We present a cost-aware, batch Bayesian optimization scheme powered by deep Gaussian process (DGP) surrogates and a heterotopic querying strategy.<n>Our framework converges to optimal formulations in fewer iterations with cost-aware queries than conventional GP-based BO.
  arXiv  Detail & Related papers  (2025-09-17T20:22:08Z)
• Model Accuracy and Data Heterogeneity Shape Uncertainty Quantification in Machine Learning Interatomic Potentials [5.955636672018519]
  Machine learning interatomic potentials (MLIPs) enable accurate atomistic modelling, but reliable uncertainty quantification (UQ) remains elusive.<n>In this study, we investigate two UQ strategies, ensemble learning and D-optimality, within the atomic cluster expansion framework.
  arXiv  Detail & Related papers  (2025-08-05T12:52:49Z)
• Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum [78.27945336558987]
  Decentralized server (DFL) eliminates reliance on client-client architecture.<n>Non-smooth regularization is often incorporated into machine learning tasks.<n>We propose a novel novel DNCFL algorithm to solve these problems.
  arXiv  Detail & Related papers  (2025-04-17T08:32:25Z)
• ACMamba: Fast Unsupervised Anomaly Detection via An Asymmetrical Consensus State Space Model [51.83639270669481]
  Unsupervised anomaly detection in hyperspectral images (HSI) aims to detect unknown targets from backgrounds.<n>HSI studies are hindered by steep computational costs due to the high-dimensional property of HSI and dense sampling-based training paradigm.<n>We propose an Asymmetrical Consensus State Space Model (ACMamba) to significantly reduce computational costs without compromising accuracy.
  arXiv  Detail & Related papers  (2025-04-16T05:33:42Z)
• Energy-Guided Continuous Entropic Barycenter Estimation for General Costs [95.33926437521046]
  We propose a novel algorithm for approximating the continuous Entropic OT (EOT) barycenter for arbitrary OT cost functions.<n>Our approach is built upon the dual reformulation of the EOT problem based on weak OT.
  arXiv  Detail & Related papers  (2023-10-02T11:24:36Z)
• Small Object Detection via Coarse-to-fine Proposal Generation and Imitation Learning [52.06176253457522]
  We propose a two-stage framework tailored for small object detection based on the Coarse-to-fine pipeline and Feature Imitation learning. CFINet achieves state-of-the-art performance on the large-scale small object detection benchmarks, SODA-D and SODA-A.
  arXiv  Detail & Related papers  (2023-08-18T13:13:09Z)
• Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity [51.476337785345436]
  We study a pessimistic variant of Q-learning in the context of finite-horizon Markov decision processes. A variance-reduced pessimistic Q-learning algorithm is proposed to achieve near-optimal sample complexity.
  arXiv  Detail & Related papers  (2022-02-28T15:39:36Z)
• Tractable and Near-Optimal Adversarial Algorithms for Robust Estimation in Contaminated Gaussian Models [1.609950046042424]
  Consider the problem of simultaneous estimation of location and variance matrix under Huber's contaminated Gaussian model. First, we study minimum $f$-divergence estimation at the population level, corresponding to a generative adversarial method with a nonparametric discriminator. We develop tractable adversarial algorithms with simple spline discriminators, which can be implemented via nested optimization. The proposed methods are shown to achieve minimax optimal rates or near-optimal rates depending on the $f$-divergence and the penalty used.
  arXiv  Detail & Related papers  (2021-12-24T02:46:51Z)
• Attribute-Guided Adversarial Training for Robustness to Natural Perturbations [64.35805267250682]
  We propose an adversarial training approach which learns to generate new samples so as to maximize exposure of the classifier to the attributes-space. Our approach enables deep neural networks to be robust against a wide range of naturally occurring perturbations.
  arXiv  Detail & Related papers  (2020-12-03T10:17:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.