相关论文: Web of Lossy Adapters for Interface Interoperabili…

Multilingual machine translation suffers from negative interference across languages. A common solution is to relax parameter sharing with language-specific modules like adapters. However, adapters of related languages are unable to…

In many covering settings, it is natural to consider the presence both of elements that we seek to include and of elements that we seek to avoid. This paper introduces a novel combinatorial problem formalizing this tradeoff: from a…

We consider the optimisation problem of adding $k$ links to a given network, such that the resulting effective graph resistance is as small as possible. The problem was recently proven to be NP-hard, such that optimal solutions obtained…

The non-uniform demand network coding problem is posed as a single-source and multiple-sink network transmission problem where the sinks may have heterogeneous demands. In contrast with multicast problems, non-uniform demand problems are…

This paper considers the maximization of the expected maximum value of a portfolio of random variables subject to a budget constraint. We refer to this as the optimal college application problem. When each variable's cost, or each college's…

We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We disprove it. We show that the problem is NP-hard in general.…

Under a standard assumption in complexity theory (NP not in P/poly), we demonstrate a gap between the minimax prediction risk for sparse linear regression that can be achieved by polynomial-time algorithms, and that achieved by optimal…

Compressed sensing (CS) is a challenging problem in image processing due to reconstructing an almost complete image from a limited measurement. To achieve fast and accurate CS reconstruction, we synthesize the advantages of two well-known…

Given the stringent requirements of energy efficiency for Internet-of-Things edge devices, approximate multipliers, as a basic component of many processors and accelerators, have been constantly proposed and studied for decades, especially…

This paper considers downlink of reconfigurable intelligent surface (RIS) assisted cooperative non-orthogonal multiple access (CNOMA) systems. Our objective is to minimize the total transmit power by jointly optimizing the active…

To address efficiency and design challenges in choice-based matching platforms, we introduce a two-sided assortment optimization framework under general choice preferences. The goal in this problem is to maximize the expected number of…

This paper presents an efficient algorithm for robust network reconstruction of Linear Time-Invariant (LTI) systems in the presence of noise, estimation errors and unmodelled nonlinearities. The method here builds on previous work on robust…

In this work, we develop an adaptive algorithm for the efficient numerical solution of the minimum compliance problem in topology optimization. The algorithm employs the phase field approximation and continuous density field. The adaptive…

In this letter, we analyze the performance of the intelligent reflecting surface (IRS) assisted downlink non-orthogonal multiple access (NOMA) systems in the presence of imperfect phase compensation. We derive an upper bound on the…

As techniques for graph query processing mature, the need for optimization is increasingly becoming an imperative. Indices are one of the key ingredients toward efficient query processing strategies via cost-based optimization. Due to the…

This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF). It derives an output-polynomial time algorithm to determine all supported efficient…

An $hp$ version of interface penalty finite element method ($hp$-IPFEM) is proposed for elliptic interface problems in two and three dimensions on unfitted meshes. Error estimates in broken $H^1$ norm, which are optimal with respect to $h$…

We propose a information theoretical framework to capture transition and information costs of network navigation models. Based on the minimum description length principle and the Markov decision process, we demonstrate that efficient global…

Most optimization problems are notoriously hard. Considerable efforts must be spent in obtaining an optimal solution to certain instances that we encounter in the real world scenarios. Often it turns out that input instances get modified…

We study a network design problem (NDP) where the planner aims at selecting the optimal single-link intervention on a transportation network to minimize the travel time under Wardrop equilibrium flows. Our first result is that, if the delay…