English
Related papers

Related papers: Unique Preference Aggregation in Design and Decisi…

200 papers

Recent deep reinforcement learning methods have achieved remarkable success in solving multi-objective combinatorial optimization problems (MOCOPs) by decomposing them into multiple subproblems, each associated with a specific weight…

Artificial Intelligence · Computer Science 2026-03-23 Mingfeng Fan , Jianan Zhou , Yifeng Zhang , Yaoxin Wu , Jinbiao Chen , Guillaume Adrien Sartoretti

It is well known that since the sort/shuffle stage in MapReduce is costly, local aggregation is one important principle to designing efficient algorithms. This short paper represents an attempt to more clearly articulate this design…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-04-30 Jimmy Lin

We consider Bayesian optimization of expensive-to-evaluate experiments that generate vector-valued outcomes over which a decision-maker (DM) has preferences. These preferences are encoded by a utility function that is not known in closed…

Machine Learning · Computer Science 2022-03-23 Zhiyuan Jerry Lin , Raul Astudillo , Peter I. Frazier , Eytan Bakshy

We study a two-alternative voting game where voters' preferences depend on an unobservable world state and each voter receives a private signal correlated to the true world state. We consider the collective decision when voters can…

Computer Science and Game Theory · Computer Science 2024-10-11 Xiaotie Deng , Biaoshuai Tao , Ying Wang

This paper introduces a Transformer-based integrative feature and cost aggregation network designed for dense matching tasks. In the context of dense matching, many works benefit from one of two forms of aggregation: feature aggregation,…

Computer Vision and Pattern Recognition · Computer Science 2024-04-23 Sunghwan Hong , Seokju Cho , Seungryong Kim , Stephen Lin

Multiobjective optimization (MOO) is prevalent in numerous applications, in which a Pareto front (PF) is constructed to display optima under various preferences. Previous methods commonly utilize the set of Pareto objectives (particles on…

Machine Learning · Computer Science 2024-02-16 Xiaoyuan Zhang , Xi Lin , Yichi Zhang , Yifan Chen , Qingfu Zhang

Finding a \emph{single} best solution is the most common objective in combinatorial optimization problems. However, such a single solution may not be applicable to real-world problems as objective functions and constraints are only…

Data Structures and Algorithms · Computer Science 2022-01-25 Tesshu Hanaka , Masashi Kiyomi , Yasuaki Kobayashi , Yusuke Kobayashi , Kazuhiro Kurita , Yota Otachi

Recommender systems are important to help users select relevant and personalised information over massive amounts of data available. We propose an unified framework called Preference Network (PN) that jointly models various types of domain…

Information Retrieval · Computer Science 2014-07-23 Tran The Truyen , Dinh Q. Phung , Svetha Venkatesh

TOPSIS, a popular method for ranking alternatives is based on aggregated distances to ideal and anti-ideal points. As such, it was considered to be essentially different from widely popular and acknowledged `utility-based methods', which…

Artificial Intelligence · Computer Science 2025-04-14 Robert Susmaga , Izabela Szczech

With increases in population, there is a noticeable change across the world in pollution levels. Recently there has been growing demand for renewable energy operated devices boomed. Numerous reasons have led to such growth including lower…

Optimization and Control · Mathematics 2023-03-31 Mahak Bhatia , Aled Williams

Multi-Criteria Decision Analysis (MCDA) methods are widely used in various fields and disciplines. While most of the research has been focused on the development and improvement of new MCDA methods, relatively limited attention has been…

Artificial Intelligence · Computer Science 2018-10-29 Jarosław Wątróbski , Jarosław Jankowski , Paweł Ziemba , Artur Karczmarczyk , Magdalena Zioło

We consider the challenge of AI value alignment with multiple individuals that have different reward functions and optimal policies in an underlying Markov decision process. We formalize this problem as one of policy aggregation, where the…

Artificial Intelligence · Computer Science 2024-11-07 Parand A. Alamdari , Soroush Ebadian , Ariel D. Procaccia

A minimum Manhattan distance (MMD) approach to multiple criteria decision making in multiobjective optimization problems (MOPs) is proposed. The approach selects the final solution corresponding with a vector that has the MMD from a…

Optimization and Control · Mathematics 2017-05-05 Wei-Yu Chiu , Gary G. Yen , Teng-Kuei Juan

Ensemble models refer to methods that combine a typically large number of classifiers into a compound prediction. The output of an ensemble method is the result of fitting a base-learning algorithm to a given data set, and obtaining diverse…

Machine Learning · Statistics 2019-06-10 Waldyn Martinez

Increasing aggregate diversity (or catalog coverage) is an important system-level objective in many recommendation domains where it may be desirable to mitigate the popularity bias and to improve the coverage of long-tail items in…

Information Retrieval · Computer Science 2020-06-09 Farzad Eskandanian , Bamshad Mobasher

The classical linear ordering problem seeks a single ranking representing a given preference matrix. While suitable for homogeneous populations, it fails when observed preferences arise from several latent groups with distinct ranking…

Optimization and Control · Mathematics 2026-05-15 Juan A. Aledo , Concepción Domínguez , Juan de Dios Jaime-Alcántara , Mercedes Landete

Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which…

Logic in Computer Science · Computer Science 2011-04-15 Krishnendu Chatterjee , Thomas A. Henzinger , Barbara Jobstmann , Rohit Singh

The main purpose of data mining and analytics is to find novel, potentially useful patterns that can be utilized in real-world applications to derive beneficial knowledge. For identifying and evaluating the usefulness of different kinds of…

We consider the problem of committee selection from a fixed set of candidates where each candidate has multiple quantifiable attributes. To select the best possible committee, instead of voting for a candidate, a voter is allowed to approve…

Computer Science and Game Theory · Computer Science 2020-08-17 Venkateswara Rao Kagita , Arun K Pujari , Vineet Padmanabhan , Vikas Kumar

This paper presents an efficient preference elicitation framework for uncertain matroid optimization, where precise weight information is unavailable, but insights into possible weight values are accessible. The core innovation of our…

Machine Learning · Computer Science 2025-03-26 Aditya Sai Ellendula , Arun K Pujari , Vikas Kumar , Venkateswara Rao Kagita