Semantic probabilistic layers for neuro-symbolic learning

K Ahmed, S Teso, KW Chang… - Advances in …, 2022 - proceedings.neurips.cc
We design a predictive layer for structured-output prediction (SOP) that can be plugged into
any neural network guaranteeing its predictions are consistent with a set of predefined …

A semantic loss function for deep learning with symbolic knowledge

J Xu, Z Zhang, T Friedman, Y Liang… - … on machine learning, 2018 - proceedings.mlr.press
This paper develops a novel methodology for using symbolic knowledge in deep learning.
From first principles, we derive a semantic loss function that bridges between neural output …

Challenges, experiments, and computational solutions in peer review

NB Shah - Communications of the ACM, 2022 - dl.acm.org
Challenges, experiments, and computational solutions in peer review Page 1 76
COMMUNICATIONS OF THE ACM | JUNE 2022 | VOL. 65 | NO. 6 review articles IMA GER YB Y …

[图书][B] Multi-winner voting with approval preferences

M Lackner, P Skowron - 2023 - library.oapen.org
From fundamental concepts and results to recent advances in computational social choice,
this open access book provides a thorough and in-depth look at multi-winner voting based …

[HTML][HTML] Finding a collective set of items: From proportional multirepresentation to group recommendation

P Skowron, P Faliszewski, J Lang - Artificial Intelligence, 2016 - Elsevier
We consider the following problem: There is a set of items (eg, movies) and a group of
agents (eg, passengers on a plane); each agent has some intrinsic utility for each of the …

Mitigating manipulation in peer review via randomized reviewer assignments

S Jecmen, H Zhang, R Liu, N Shah… - Advances in …, 2020 - proceedings.neurips.cc
We consider three important challenges in conference peer review:(i) reviewers maliciously
attempting to get assigned to certain papers to provide positive reviews, possibly as part of …

Preference restrictions in computational social choice: A survey

E Elkind, M Lackner, D Peters - arXiv preprint arXiv:2205.09092, 2022 - arxiv.org
Social choice becomes easier on restricted preference domains such as single-peaked,
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …

[PDF][PDF] Computational aspects of multi-winner approval voting

H Aziz, S Gaspers, J Gudmundsson… - Workshops at the …, 2014 - cdn.aaai.org
We study computational aspects of three prominent voting rules that use approval ballots to
elect multiple winners. These rules are satisfaction approval voting, proportional approval …

Structured preferences: a literature survey

AV Karpov - Automation and Remote Control, 2022 - Springer
A survey of papers on practically significant restrictions on the preference profile of a
collective is carried out, including single-peaked preferences, group-separable preferences …

Building ethically bounded AI

F Rossi, N Mattei - Proceedings of the AAAI Conference on Artificial …, 2019 - aaai.org
The more AI agents are deployed in scenarios with possibly unexpected situations, the more
they need to be flexible, adaptive, and creative in achieving the goal we have given them …