paperlist.ai

AI conference papers

AI conference paper library

Search papers from 30+ top conferences, including NeurIPS, ICLR, ICML, CVPR, ACL and AAAI. Filter by keyword, then open any paper for its abstract, authors and links.

arXiv

From Paper to Program: Knowledge Externalization and Bottleneck Diagnosis in AI-Assisted Quantum Many-Body Programming

Yi Zhou

Implementing quantum many-body algorithms from the literature is fragile when executable correctness depends on tacit choices of index order, gauge, fermionic sign, contraction sequence, and scaling strategy. We formulate this as a knowledge-externalization problem and test a staged, human-in-the-loop workflow that converts source papers into reviewed technical specifications before code generation. DMRG from Schollw{ö}ck's review serves as calibration: specification-guided implementations pass all 16 model pairings, compared with 6/13 direct attempts, while a prose-specification ablation retains the improvement when externalized content is preserved without \LaTeX{} form. Pfaffian conversion of HFB states to MPS from a five-page Letter provides a closed-world stress test using standalone NumPy/SciPy/Matplotlib implementations without supplied tensor-network code. The workflow yields 11/26 audited passes, versus none under direct prompting. Cross-specification transfer is asymmetric: GPT~5.5 implements four non-GPT specifications successfully, whereas the reverse direction fails in four tested cases. These results support two distinguishable bottlenecks: paper-to-code ambiguity, reduced by explicit specification, and residual implementation-agent capability. Iterative meta-specification shifts but does not remove the latter. The resulting \emph{Paper-to-Program Many-Body} protocol couples expert review, provenance checks, production-scale gates, and physics oracles to provide an auditable pathway from published many-body theory to validated code.

arXiv

$\mathrm{ECI}_{\mathrm{sem}}$: Semantic Residual Effective Contrastive Information for Evaluating Hard Negatives

Aarush Sinha, Rahul Seetharaman, Aman Bansal

Hard-negative source selection for dense retrieval is usually decided only after fine-tuning and downstream evaluation. We propose ECIsem, a validity-weighted diagnostic that ranks candidate hard-negative sources using frozen target-encoder embeddings. ECIsem is training-free, not label-free: each scored example requires a query, a labeled positive, and an explicit candidate negative. Each negative is weighted by target consistency, semantic locality, and lexical residuality, and the source score aggregates weighted residual directions through a log-determinant. At the scale we study, the log-determinant operates in its linear regime, so the score reduces to the mean validity weight; we report this reduction as a finding, and gate ablations show that a single lexical scalar, mean lexical residuality, reproduces the transfer ordering in every block. On MS MARCO negative sources, in-family ECIsem recovers the aggregate BEIR transfer ordering across DistilBERT, E5-base, and Contriever. Constructed controls expose an identifiability limit: a plausible false negative is non-inverted, near the positive, and lexically novel, exactly the profile the gates reward, and across twelve weightings of the three gates and three backbones only one of thirty-six cells is safe, and it is not transfer aligned, a limit that extends to margin-style filters built from the same statistics. The same gate statistics separate the controls sharply when used as audit features rather than as rewards, so we pair the score with a reported audit profile instead of a reweighting.

arXiv

JEPA-DNA: Grounding Genomic Foundation Models through Joint-Embedding Predictive Architectures

Ariel Larey, Elay Dahan, Amit Bleiweiss, Raizy Kellerman, Guy Leib, Omri Nayshool, Dan Ofer, Tal Zinger, Dan Dominissini, Gideon Rechavi, Nicole Bussola, Simon Lee, Shane O'Connell, Dung Hoang, Marissa Wirth, Alexander W. Charney, Nati Daniel, Yoli Shavit

Genomic Foundation Models (GFMs) typically rely on Masked Language Modeling (MLM) or Next-Token Prediction (NTP) to learn the "Laws of Nature". While effective at capturing local syntax, these generative paradigms prioritize token-level reconstruction over high-level functional context. We introduce JEPA-DNA, a model-agnostic continual training framework that integrates a Joint-Embedding Predictive Architecture (JEPA) with traditional generative objectives. By supervising global sequence embeddings in a latent space, JEPA-DNA forces models to predict the functional representations of masked genomic segments, shifting the learning signal from token recovery to semantic alignment. We evaluate JEPA-DNA on 17 diverse genomic benchmark tasks, demonstrating consistent gains in linear probing and zero-shot performance regardless of the underlying GFM architecture or generative objective. Our framework establishes a new state-of-the-art for GFMs, surpassing the best existing models by bridging generative precision with latent semantic grounding. Through extensive ablation studies, we further characterize the synergistic interplay between generative and latent objectives. Our code is publicly available at https://github.com/NVIDIA-Digital-Bio/JEPA-DNA.

arXiv

Leveraging Large Language Models for Causal Discovery: a Constraint-based, Argumentation-driven Approach

Zihao Li, Fabrizio Russo

Causal discovery seeks to uncover causal relations from data, typically represented as causal graphs, and is essential for predicting the effects of interventions. While expert knowledge is required to construct principled causal graphs, many statistical methods have been proposed to leverage observational data with varying formal guarantees. Causal Assumption-based Argumentation (ABA) is a framework that uses symbolic reasoning to ensure correspondence between input constraints and output graphs, while offering a principled way to combine data and expertise. We explore the use of large language models (LLMs) as imperfect experts for Causal ABA, eliciting semantic structural priors from variable names and descriptions and integrating them with conditional-independence evidence. Experiments on standard benchmarks and semantically grounded synthetic graphs demonstrate state-of-the-art performance, and we additionally introduce an evaluation protocol to mitigate memorisation bias when assessing LLMs for causal discovery.

arXiv

Situation Graph Prediction for User Perspective Modeling

Jisung Shin, Daniel Platnick, Marjan Alirezaie, Hossein Rahnama

Perspective-aware AI requires modeling evolving internal states---goals, emotions, contexts---not merely preferences. Progress is limited by a data bottleneck: digital footprints are privacy-sensitive and perspective states are rarely labeled. We propose Situation Graph Prediction (SGP), a task that frames user perspective modeling as an inverse inference problem: reconstructing structured, ontology-aligned representations of perspective from observable multimodal artifacts, suitable as long-horizon memory for personal agents. To enable grounding without real labels, we use a structure-first synthetic generation strategy that aligns latent labels and observable traces by design. As a pilot, we construct a dataset and run a diagnostic study using retrieval-augmented in-context learning as a proxy for supervision. In our diagnostic study across three frontier foundation models (GPT-4o, Gemini 2.5 Flash, Claude Sonnet 4), we observe a consistent positive gap between surface-level extraction and latent perspective inference---indicating that latent-state inference is consistently harder than surface extraction under our controlled setting. Results suggest SGP is non-trivial and provide evidence for the structure-first data synthesis strategy. For reproducibility and transparency, our code, data, and supplementary resources are available here: https://github.com/flybits/sg-prediction.

arXiv

GraFine: Retrieval-Time Refinement for Efficient Graph RAG over Corpus Graphs

Seonho An, Chaejeong Hyun, Min-Soo Kim

Graph RAG on corpus graphs enhances retrieval by leveraging intermediate node content as contextual clues to uncover unretrieved oracle nodes. However, existing methods suffer from two critical blind spots, namely semantically blind graph expansion and topology blind pruning, or else rely on prohibitively slow retrieval and generation interleaving. To address this, we formalize these limitations through an operational taxonomy and propose a retriever design that couples semantics-aware adding with graph-aware pruning under efficiency constraints. We instantiate this design as GraFine, which alternates between two refinement stages: Semantic Proximity eXpansion (SPX) for semantics-aware node addition, and a Graph Smoothing Reranker (GSR) for graph-aware pruning. Experiments on reference networks and text-rich knowledge graphs show that GraFine improves retrieval accuracy and generation quality while maintaining time-efficiency. Furthermore, we introduce Topological Recall (TR), a metric that quantifies the topological proximity between retrieved and oracle nodes. Our analysis using TR confirms that GraFine more effectively steers refinement toward undiscovered oracle nodes by leveraging intermediate contextual clues. Our code is available at this link: https://github.com/asmath472/GraFine.

arXiv

IndexTTS 2.5 Technical Report

Yunpei Li, Xun Zhou, Jinchao Wang, Lu Wang, Yong Wu, Siyi Zhou, Yiquan Zhou, Yining Wang, Yaogen Yang, Zhetao Hu, Shiyao Duan, Jiacheng Xu, Jingchen Shu, Bin Xia

In prior work, we introduced IndexTTS 2, a zero-shot neural text-to-speech foundation model comprising two core components: a transformer-based Text-to-Semantic (T2S) module and a non-autoregressive Semantic-to-Mel (S2M) module, which together enable faithful emotion replication and establish the first autoregressive duration-controllable generative paradigm. Building upon this, we present IndexTTS 2.5, which significantly enhances multilingual coverage, inference speed, and overall synthesis quality through four key improvements: 1) Semantic Codec Compression: we reduce the semantic codec frame rate from 50 Hz to 25 Hz, halving sequence length and substantially lowering both training and inference costs; 2) Architectural Upgrade: we replace the U-DiT-based backbone of the S2M module with a more efficient Zipformer-based modeling architecture, achieving notable parameter reduction and faster mel-spectrogram generation; 3) Multilingual Extension: We propose three explicit cross-lingual modeling strategies, boundary-aware alignment, token-level concatenation, and instruction-guided generation, establishing practical design principles for zero-shot multilingual emotional TTS that supports Chinese, English, Japanese, and Spanish, and enables robust emotion transfer even without target-language emotional training data; 4) Reinforcement Learning Optimization: we apply GRPO in post-training of the T2S module, improving pronunciation accuracy and natrualness. Experiments show that IndexTTS 2.5 not only supports broader language coverage but also replicates emotional prosody in unseen languages under the same zero-shot setting. IndexTTS 2.5 achieves a 2.28 times improvement in RTF while maintaining comparable WER and speaker similarity to IndexTTS 2.

arXiv

Trust Region Constrained Bayesian Optimization with Penalized Constraint Handling

Raju Chowdhury, Tanmay Sen, Biswabrata Pradhan

Constrained optimization in high-dimensional black-box settings is difficult due to expensive evaluations, the lack of gradient information, and complex feasibility regions. In this work, we propose a Bayesian optimization method that combines a penalty formulation, a surrogate model, and a trust region strategy. The constrained problem is converted to an unconstrained form by penalizing constraint violations, which provides a unified modeling framework. A trust region restricts the search to a local region around the current best solution, which improves stability and efficiency in high dimensions. Within this region, we use the Expected Improvement acquisition function to select evaluation points by balancing improvement and uncertainty. The proposed Trust Region method integrates penalty-based constraint handling with local surrogate modeling. This combination enables efficient exploration of feasible regions while maintaining sample efficiency. We compare the proposed method with state-of-the-art methods on synthetic and real-world high-dimensional constrained optimization problems. The results show that the method identifies high-quality feasible solutions with fewer evaluations and maintains stable performance across different settings.

arXiv

Reconfiguration of pivoting cube ensembles under local sensing constraints using geometric deep learning

Nadezhda Dobreva, Emmanuel Blazquez, Jai Grover, Dario Izzo, Yuzhen Qin, Dominik Dold

We demonstrate that local sensing is sufficient for effective global reconfiguration of homogeneous pivoting cube modular robots in two dimensions. While cube selection (i.e., which cube executes a movement) is assumed to be globally coordinated, each cube in the ensemble is controlled by a neural network that only gains information from other cubes in its local neighbourhood, trained using reinforcement learning. Furthermore, we study the effect of including grid symmetries of the cube ensemble (rotation and mirroring) in the neural network architecture. We find that even the most localised versions succeed in reconfiguring to the target shape, although reconfiguration happens faster the more information about the whole ensemble is available to individual cubes. Near-optimal reconfiguration is achieved with only nearest neighbour interactions by using multiple information passing between cubes, allowing them to accumulate more global information about the ensemble. Compared to standard neural network architectures, including grid symmetries provides only minor benefits during training, but allows for reduced model sizes. The presented approach is transferable to other space-relevant systems with different action spaces, such as sliding cube modular robots and CubeSat swarms.

arXiv

Selective Prediction Reduces the Negative Effects of Automation Bias Overall but Increases False Negatives

Sarah Jabbour, David Fouhey, Nikola Banovic, Stephanie D. Shepard, Ella Kazerooni, Michael W. Sjoding, Jenna Wiens

AI has the potential to augment human decision making. However, even high-performing models can produce inaccurate predictions when deployed. These inaccuracies, combined with automation bias, where humans overrely on AI predictions, can result in worse decisions. Selective prediction, in which potentially unreliable model predictions are hidden from users, has been proposed as a solution. This approach assumes that when AI abstains and informs the user so, humans make decisions as they would without AI involvement. To test this assumption, we study the effects of selective prediction on human decisions in a clinical context. We conducted a user study of 259 clinicians tasked with diagnosing and treating hospitalized patients. We compared their baseline performance without any AI involvement to their AI-assisted accuracy with and without selective prediction. Our findings indicate that selective prediction mitigates the negative effects of inaccurate AI in terms of decision accuracy. Compared to no AI assistance, clinician accuracy declined when shown inaccurate AI predictions (66% [95% CI: 56%-75%] vs. 56% [95% CI: 46%-66%]), but recovered under selective prediction (64% [95% CI: 54%-73%]). However, while selective prediction nearly maintains overall accuracy, our results suggest that it alters patterns of mistakes: when informed the AI abstains, clinicians underdiagnose (18% increase in missed diagnoses) and undertreat (35% increase in missed treatments) compared to no AI input at all. Our findings underscore the importance of empirically validating assumptions about how humans engage with AI within human-AI systems.

arXiv

Astrolabe: Balancing Load in LLM Serving with Randomized Prediction-Guided Scheduling

Wei Da, Evangelia Kalyvianaki

This paper presents Astrolabe, a randomized prediction-guided scheduler for one-shot request dispatch in multi-instance large language model (LLM) serving. Astrolabe improves load balancing without relying on migration-based rebalancing, whose KV-cache transfers can introduce substantial overhead and network contention under high load. It combines response-length estimation, per-instance simulation-based latency prediction, and a power-of-two-choices dispatch policy to balance load while avoiding request herding. On the default Llama-2-7B/ShareGPT setup, Astrolabe matches the SLO capacity of the best load-aware baseline (31.6 versus 31.5 QPS), while reducing mean time-to-first-token (TTFT) by 8 to 36 percent, P99 TTFT by 16 to 77 percent, and mean end-to-end (E2E) latency by up to 5.6 percent, with approximately six times fewer preemptions once capacity is reached. Under configuration shifts, Astrolabe improves SLO capacity by up to 6 percent on Qwen2-7B and 7.1 percent under tight batching, reduces mean E2E latency by 6 to 9 percent under bursty arrivals, and achieves an approximately 2.8-fold reduction in per-predictor CPU usage relative to full fanout. With migration enabled on A100 GPUs, Astrolabe outperforms Llumnix by up to 2.6 times in throughput while achieving orders-of-magnitude lower per-token latency at saturation.

arXiv

OpenDPDv2: A Unified Learning and Optimization Framework for Neural Network Digital Predistortion

Yizhuo Wu, Ang Li, Chang Gao

Neural network (NN)-based Digital Predistortion (DPD) improves linearization for wideband radio frequency (RF) power amplifiers (PAs) but often increases the complexity of the digital back-end. This paper presents OpenDPDv2, an open-source end-to-end framework that unifies PA modeling, NN-DPD learning, and deployment-oriented optimization. OpenDPDv2 introduces temporal residual (TRes)-Delta Gated Recurrent Unit (DeltaGRU), a delta-RNN DPD architecture with a lightweight temporal residual path for robust operation under aggressive temporal sparsity, and supports joint optimization with fixed-point quantization. On a 3.5 GHz GaN Doherty PA driven by a TM3.1a 200 MHz 256-QAM OFDM signal, the FP32 TRes-DeltaGRU model achieves -59.9 dBc Adjacent Channel Power Ratio (ACPR) and -42.1 dB Error Vector Magnitude (EVM). With 56% temporal sparsity and W12A12 quantization, the model uses 450 active parameters while maintaining -51.8 dBc ACPR and -35.2 dB EVM. Timing-accurate Gem5-based evaluation further indicates a 4.5x reduction in forward-pass energy for this deployment-oriented operating point. Code, datasets, and documentation are publicly available at https://github.com/lab-emi/OpenDPD.

arXiv

Music Interpretation and Emotion Perception: A Computational and Neurophysiological Investigation

Vassilis Lyberatos, Spyridon Kantarelis, Ioanna Zioga, Christina Anagnostopoulou, Giorgos Stamou, Anastasia Georgaki

This study investigates emotional expression and perception in music performance using computational and neurophysiological methods. The influence of different performance settings, such as repertoire, diatonic modal etudes, and improvisation, as well as levels of expressiveness, on performers' emotional communication and listeners' reactions is explored. Professional musicians performed various tasks, and emotional annotations were provided by both performers and the audience. Audio analysis revealed that expressive and improvisational performances exhibited unique acoustic features, while emotion analysis showed stronger emotional responses. Neurophysiological measurements indicated greater relaxation in improvisational performances. This multimodal study highlights the significance of expressivity in enhancing emotional communication and audience engagement.

arXiv

GAM-Agent: Game-Theoretic and Uncertainty-Aware Collaboration for Complex Visual Reasoning

Jusheng zhang, Yijia Fan, Wenjun Lin, Ruiqi Chen, Haoyi Jiang, Wenhao Chai, Jian Wang, Keze Wang

We propose GAM-Agent, a game-theoretic multi-agent framework for enhancing vision-language reasoning. Unlike prior single-agent or monolithic models, GAM-Agent formulates the reasoning process as a non-zero-sum game between base agents--each specializing in visual perception subtasks--and a critical agent that verifies logic consistency and factual correctness. Agents communicate via structured claims, evidence, and uncertainty estimates. The framework introduces an uncertainty-aware controller to dynamically adjust agent collaboration, triggering multi-round debates when disagreement or ambiguity is detected. This process yields more robust and interpretable predictions. Experiments on four challenging benchmarks--MMMU, MMBench, MVBench, and V*Bench--demonstrate that GAM-Agent significantly improves performance across various VLM backbones. Notably, GAM-Agent boosts the accuracy of small-to-mid scale models (e.g., Qwen2.5-VL-7B, InternVL3-14B) by 5--6\%, and still enhances strong models like GPT-4o by up to 2--3\%. Our approach is modular, scalable, and generalizable, offering a path toward reliable and explainable multi-agent multimodal reasoning.

arXiv

X2C: A Large-Scale Benchmark for Nuanced Humanoid Facial Expression Imitation

Peizhen Li, Longbing Cao, Xiao-Ming Wu, Runze Yang, Xiaohan Yu

Fine-grained facial expression transfer from humans to humanoid agents presents a unique pattern recognition challenge due to the significant domain gap between biological facial dynamics and mechanical control spaces. While visual synthesis of talking heads has advanced rapidly, mapping high-dimensional visual cues to precise, physically constrained actuation signals remains an open problem, primarily due to the lack of large-scale paired data. To bridge this gap, we introduce X2C, a comprehensive benchmark dataset comprising 100,000 (image, control value) pairs. Unlike existing resources, X2C features nuanced, physically grounded expressions annotated with 30 continuous control parameters, establishing a high-fidelity standard for this task. Building on this resource, we propose X2CNet, a two-stage deep learning framework that explicitly decouples visual motion features from mechanical control regression to model the correspondence between human perceptual cues and humanoid actuation. Extensive experiments, including quantitative benchmarking and real-world physical validation, demonstrate that our approach achieves superior cross-domain consistency and enables robust, in-the-wild expression imitation. Code and Data: https://lipzh5.github.io/X2CNet/

arXiv

Protecting Creative Writing Copyright against AI Imitation via Implicit Watermarking

Ziwei Zhang, Juan Wen, Wanli Peng, Zhengxian Wu, Yinghan Zhou, Yiming Xue

Large language models (LLMs) enable powerful knowledge injection through approaches such as in-context learning and fine-tuning, but they also introduce new risks of unauthorized imitation of high-value creative works. Existing copyright protection techniques mainly focus on visual media, leaving the protection of creative writing largely unexplored. In this work, we investigate a new challenge: verifying whether AI-generated texts inherit the creative essence of protected works without authorization. We propose WIND (Watermarking via Implicit and Non-disruptive Disentanglement), a zero-watermarking framework that constructs an implicit and verifiable creative signature for copyright verification. WIND decomposes creative essence into five complementary dimensions and leverages an LLM-based instance delimitation mechanism to extract condensed representations of protected creative characteristics. By disentangling creative-specific information from irrelevant textual variations, these representations are mapped into a compact watermark space without modifying the original texts. Extensive experiments demonstrate that WIND achieves over 98\% F1 scores while maintaining low false-positive rates, substantially outperforming existing watermarking and text classification approaches under various AI imitation scenarios.

arXiv

Probably Approximately Correct Maximum A Posteriori Inference

Matthew Shorvon, Frederik Mallmann-Trenn, David S. Watson

Computing the conditional mode of a distribution, better known as the maximum a posteriori (MAP) assignment, is a fundamental task in probabilistic inference. However, MAP is generally intractable, and remains hard even under many common structural constraints and approximation schemes. We take a novel approach inspired by multi-armed bandits, recasting MAP as a best arm identification task. We introduce probably approximately correct (PAC) algorithms for MAP that provide provably optimal solutions in both the fixed-confidence and fixed-budget regimes. We characterize tractability conditions using information theoretic measures that can be estimated from finite samples. Our PAC-MAP solvers are efficiently implemented using probabilistic circuits and graphical models with appropriate architectures. The algorithms we develop can be used either as standalone MAP estimators or to improve on standard heuristics, fortifying their solutions with rigorous guarantees. Experiments confirm the benefits of our method in a range of benchmarks.

arXiv

Pretrained Optimization Model for Zero-Shot Black Box Optimization

Xiaobin Li, Kai WU, Yujian Betterest Li, Xiaoyu Zhang, Handing Wang, Jing Liu

Zero-shot optimization involves optimizing a target task that was not seen during training, aiming to provide the optimal solution without or with minimal adjustments to the optimizer. It is crucial to ensure reliable and robust performance in various applications. Current optimizers often struggle with zero-shot optimization and require intricate hyperparameter tuning to adapt to new tasks. To address this, we propose a Pretrained Optimization Model (POM) that leverages knowledge gained from optimizing diverse tasks, offering efficient solutions to zero-shot optimization through direct application or fine-tuning with few-shot samples. Evaluation on the BBOB benchmark and two robot control tasks demonstrates that POM outperforms state-of-the-art black-box optimization methods, especially for high-dimensional tasks. Fine-tuning POM with a small number of samples and budget yields significant performance improvements. Moreover, POM demonstrates robust generalization across diverse task distributions, dimensions, population sizes, and optimization horizons. For code implementation, see https://github.com/ninja-wm/POM/.

arXiv

Graphical Models of False Information and Fact Checking Ecosystems

Haiyue Yuan, Enes Altuncu, Shujun Li, Can Baskent, Jason R. C. Nurse

The wide spread of false information online, including misinformation and disinformation, has become a major problem for our highly digitised and globalised society. A lot of research has been done to better understand different aspects of false information online such as behaviours of different actors and patterns of spreading, and also on better detection and prevention of such information using technical and socio-technical means. One major approach to detecting and debunking false information online is to use fact-checkers. Despite a lot of research on online false information, we noticed a lack of conceptual models describing the complicated ecosystem of false information and fact-checking. In this paper, we introduce the first comprehensive graphical model of the ecosystem, focusing on false information online in multiple contexts, including traditional media outlets, as well as user-generated and AI-generated content. The proposed enhanced entity-relationship (EER) model covers a wide range of entities and relationships, and it can be a new useful tool for researchers and practitioners to study false information online and the effects of fact-checking. To demonstrate its usefulness, we provide two example applications of our proposed model, modelling real-world scenarios and reviewing the research literature.

arXiv

From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms

Weijie Zheng, Benjamin Doerr

Estimation-of-distribution algorithms (EDAs) are optimization algorithms that learn a distribution on the search space from which good solutions can be sampled easily. A key parameter of most EDAs is the sample size (population size). If the population size is too small, the update of the probabilistic model builds on few samples, leading to the undesired effect of genetic drift. Too large population sizes avoid genetic drift, but slow down the process. Building on a recent quantitative analysis of how the population size leads to genetic drift, we design a smart-restart mechanism for EDAs. By stopping runs when the risk for genetic drift is high, it automatically runs the EDA in good parameter regimes. Via a mathematical runtime analysis, we prove a general performance guarantee for this smart-restart scheme. This in particular shows that in many situations where the optimal (problem-specific) parameter values are known, the restart scheme automatically finds these, leading to the asymptotically optimal performance. We also conduct an extensive experimental analysis. On four classic benchmark problems, we clearly observe the critical influence of the population size on the performance, and we find that the smart-restart scheme leads to a performance close to the one obtainable with optimal parameter values. Our results also show that previous theory-based suggestions for the optimal population size can be far from the optimal ones, leading to a performance clearly inferior to the one obtained via the smart-restart scheme. We also conduct experiments with PBIL (cross-entropy algorithm) on two combinatorial optimization problems from the literature, the max-cut problem and the bipartition problem. Again, we observe that the smart-restart mechanism finds much better values for the population size than those suggested in the literature, leading to a much better performance.

Keep browsing

More papers from top AI conferences

30+ top conferences, by conference, year, and topic.