English
Related papers

Related papers: Avoiding Redundant Restarts in Multimodal Global O…

200 papers

Many modern wireless networks integrate carrier sense mul-tiple access/collision avoidance (CSMA/CA) with exponential backoff as medium access control (MAC) technique. In order to decrease the MAC overhead and the collision probability, we…

Networking and Internet Architecture · Computer Science 2015-01-08 Baher Mawlawi , Jean-Baptiste Doré

Redundancy mechanisms consist in sending several copies of a same job to a subset of servers. It constitutes one of the most promising ways to exploit diversity in multiservers applications. However, its pros and cons are still not…

Performance · Computer Science 2021-03-22 Elene Anton , Urtzi Ayesta , Matthieu Jonckheere , Ina Maria Verloop

Token repetition is a typical form of multi-modal problem in fully non-autoregressive translation (NAT). In this work, we revisit the multi-modal problem in recently proposed NAT models. Our study reveals that these advanced models have…

Computation and Language · Computer Science 2024-05-07 Zhihao Wang , Longyue Wang , Jinsong Su , Junfeng Yao , Zhaopeng Tu

This paper proposes RCMAES, a novel variant of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) for CEC benchmark optimization. RCMAES integrates a dimension-dependent nonlinear population-size reduction strategy with an…

Neural and Evolutionary Computing · Computer Science 2026-05-01 Khoirul Faiq Muzakka , Sören Möller , Martin Finsterbusch

We develop a method to solve, theoretically and numerically, general optimal stopping problems. Our general setting allows for multiple exercise rights, i.e., optimal multiple stopping, for a robust evaluation that accounts for model…

We study a decision-maker's problem of finding optimal monetary incentive schemes for retention when faced with agents whose participation decisions (stochastically) depend on the incentive they receive. Our focus is on policies constrained…

Computer Science and Game Theory · Computer Science 2024-07-31 Daniel Freund , Chamsi Hssaine

While globally optimal solutions to many convex programs can be computed efficiently in polynomial time, this is, in general, not possible for nonconvex optimization problems. Therefore, locally optimal approaches or other efficient…

Information Theory · Computer Science 2020-07-03 Bho Matthiesen , Christoph Hellings , Eduard A. Jorswieck , Wolfgang Utschick

Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed…

Machine Learning · Computer Science 2019-06-24 Haiguang Liao , Wentai Zhang , Xuliang Dong , Barnabas Poczos , Kenji Shimada , Levent Burak Kara

We consider the non-linear optimal multiple stopping problem under general conditions on the non-linear evaluation operators, which might depend on two time indices: the time of evaluation/assessment and the horizon (when the reward or loss…

Optimization and Control · Mathematics 2025-04-21 Miryana Grigorova , Marie-Claire Quenez , Peng Yuan

Long-horizon, repetitive workflows are common in professional settings, such as processing expense reports from receipts and entering student grades from exam papers. These tasks are often tedious for humans since they can extend to extreme…

Computer Vision and Pattern Recognition · Computer Science 2026-02-03 Jing Wu , Daphne Barretto , Yiye Chen , Nicholas Gydé , Yanan Jian , Yuhang He , Vibhav Vineet

Premature convergence can be detrimental to the performance of search methods, which is why many search algorithms include restart strategies to deal with it. While it is common to perturb the incumbent solution with diversification steps…

Neural and Evolutionary Computing · Computer Science 2019-12-06 Aldeida Aleti , Mark Wallace , Markus Wagner

We are concerned with linear redundancy storage schemes regarding their ability to provide concurrent (local) recovery of multiple data objects. This paper initiates a study of such systems within the classical coding theory. We show how we…

Information Theory · Computer Science 2022-05-17 Gianira N. Alfarano , Alberto Ravagnani , Emina Soljanin

When a problem instance is perturbed by a small modification, one would hope to find a good solution for the new instance by building on a known good solution for the previous one. Via a rigorous mathematical analysis, we show that…

Neural and Evolutionary Computing · Computer Science 2019-04-17 Benjamin Doerr , Carola Doerr , Frank Neumann

We consider global optimization problems, where the feasible region $\X$ is a compact subset of $\mathbb{R}^d$ with $d \geq 10$. For these problems, we demonstrate the following. First: the actual convergence of global random search…

Optimization and Control · Mathematics 2023-02-27 Jack Noonan , Anatoly Zhigljavsky

The resource constrained multi-mode multi-project scheduling problem (RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For a given set of activities, feasible execution mode assignments and execution starting times…

Artificial Intelligence · Computer Science 2013-10-03 Martin Josef Geiger

Multimodal Retrieval-Augmented Generation (mRAG) has emerged as a promising solution to address the temporal limitations of Multimodal Large Language Models (MLLMs) in real-world scenarios like news analysis and trending topics. However,…

Artificial Intelligence · Computer Science 2025-08-13 Yuechen Wang , Yuming Qiao , Dan Meng , Jun Yang , Haonan Lu , Zhenyu Yang , Xudong Zhang

Multimodal learning seeks to utilize data from multiple sources to improve the overall performance of downstream tasks. It is desirable for redundancies in the data to make multimodal systems robust to missing or corrupted observations in…

Computer Vision and Pattern Recognition · Computer Science 2024-10-14 Md Kaykobad Reza , Ashley Prater-Bennette , M. Salman Asif

We present Model Predictive Trees (MPT), a receding horizon tree search algorithm that improves its performance by reusing information efficiently. Whereas existing solvers reuse only the highest-quality trajectory from the previous…

Robotics · Computer Science 2024-11-26 John Lathrop , Benjamin Rivi`ere , Jedidiah Alindogan , Soon-Jo Chung

We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple line pools, when the line operators have a different utility function…

Computer Science and Game Theory · Computer Science 2015-05-27 Apostolos Bessas , Spyros Kontogiannis , Christos Zaroliagis

We explore the use of residual networks and neural attention for multiple argument mining tasks. We propose a residual architecture that exploits attention, multi-task learning, and makes use of ensemble, without any assumption on document…

Computation and Language · Computer Science 2023-05-29 Andrea Galassi , Marco Lippi , Paolo Torroni