← Search

Sandra Zilles

7 accepted papers

2025

Formal Models of Active Learning from Contrastive Examples

NeurIPS 2025poster

Machine learning can greatly benefit from providing learning algorithms with pairs of contrastive training examples---typically pairs of instances that differ only slightly, yet have different class labels. Intuitively, the difference in the instances helps explain the difference in the class labels…

Cited by 0SourceScholar
2024

Approximation Algorithms for Preference Aggregation Using CP-Nets

AAAI 2024technical

This paper studies the design and analysis of approximation algorithms for aggregating preferences over combinatorial domains, represented using Conditional Preference Networks (CP-nets). Its focus is on aggregating preferences over so-called swaps, for which optimal solutions in general are already…

Cited by 0SourcePDFScholar
2022

On Batch Teaching with Sample Complexity Bounded by VCD

NeurIPS 2022accept

In machine teaching, a concept is represented by (and inferred from) a small number of labeled examples. Various teaching models in the literature cast the interaction between teacher and learner in a way to obtain a small complexity (in terms of the number of examples required for teaching a concep…

Cited by 5SourcePDFScholar
2020

Combining Direct Trust and Indirect Trust in Multi-Agent Systems

IJCAI 2020poster

To assess the trustworthiness of an agent in a multi-agent system, one often combines two types of trust information: direct trust information derived from one's own interactions with that agent, and indirect trust information based on advice from other agents. This paper provides the first systemat…

Cited by 0SourcePDFScholar