Related papers: On Generalized Optimal Hard Decision Fusion
This paper is devoted to reduce the conservatism of distributionally robust optimization with moments information. Since the optimal solution of distributionally robust optimization is required to be feasible for all uncertain distributions…
We focus on data fusion, i.e., the problem of unifying conflicting data from data sources into a single representation by estimating the source accuracies. We propose SLiMFast, a framework that expresses data fusion as a statistical…
We develop an efficient approach to evaluate range-separated exact exchange for grid or plane-wave based representations within the Generalized Kohn-Sham DFT (GKS-DFT) framework. The Coulomb kernel is fragmented in reciprocal space, and we…
We tackle the problem of collaborative filtering (CF) with side information, through the lens of Gaussian Process (GP) regression. Driven by the idea of using the kernel to explicitly model user-item similarities, we formulate the GP in a…
This paper presents a new method to solve a dynamic sensor fusion problem. We consider a large number of remote sensors which measure a common Gauss-Markov process and encoders that transmit the measurements to a data fusion center through…
Communication costs within Federated learning hinder the system scalability for reaching more data from more clients. The proposed FL adopts a hub-and-spoke network topology. All clients communicate through the central server. Hence,…
In practise, it is often desirable to provide the decision-maker with a rich set of diverse solutions of decent quality instead of just a single solution. In this paper we study evolutionary diversity optimization for the knapsack problem…
We consider an inertial primal-dual fixed point algorithm (IPDFP) to compute the minimizations of the following Problem (1.1). This is a full splitting approach, in the sense that the nonsmooth functions are processed individually via their…
In this paper, we consider a new problem of portfolio optimization using stochastic information. In a setting where there is some uncertainty, we ask how to best select $k$ potential solutions, with the goal of optimizing the value of the…
Multivariate regression techniques are commonly applied to explore the associations between large numbers of outcomes and predictors. In real-world applications, the outcomes are often of mixed types, including continuous measurements,…
We study the problem of learning efficient algorithms that strongly generalize in the framework of neural program induction. By carefully designing the input / output interfaces of the neural model and through imitation, we are able to…
A major concern in modern power systems is that the popularity and fluctuating characteristics of renewable energy may cause more and more transmission congestion events. Traditional congestion management modeling involves AC or DC power…
We propose an algorithm to compute the dynamics of articulated rigid-bodies with different sensor distributions. Prior to the on-line computations, the proposed algorithm performs an off-line optimisation step to simplify the computational…
For consensus on measurement-based distributed filtering (CMDF), through infinite consensus fusion operations during each sampling interval, each node in the sensor network can achieve optimal filtering performance with centralized…
We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem. Given a partial MaxSAT formula F and a positive integer k, the diversified top-k partial MaxSAT is to find k maximal…
This paper deals with the investigation of a closed form solution of a generalized fractional reaction-diffusion equation. The solution of the proposed problem is developed in a compact form in terms of the H-function by the application of…
The optimal fusion of estimates in a Distributed Kalman Filter (DKF) requires tracking of the complete network error covariance, problematic in terms of memory and communication. A scalable alternative is to fuse estimates under unknown…
The purpose of this paper is to solve the 0-1 $k$-item quadratic knapsack problem $(kQKP)$, a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization. The…
This paper studies generalized semi-infinite programs (GSIPs) defined with polyhedral parameter sets. Assume these GSIPs are given by polynomials. We propose a new approach to solve them as a disjunctive program. This approach is based on…
Gaussian processes have been successful in both supervised and unsupervised machine learning tasks, but their computational complexity has constrained practical applications. We introduce a new approximation for large-scale Gaussian…