Related papers: Probabilistic Aspects of Voting, Intransitivity an…
This text is a survey of the general theory of stochastic processes, with a view towards random times and enlargements of filtrations. The first five chapters present standard materials, which were developed by the French probability school…
This paper examines some methods and ideas underlying the author's successful probabilistic learning systems(PLS), which have proven uniquely effective and efficient in generalization learning or induction. While the emerging principles are…
These are notes from a three-lecture mini-course on free probability given at MSRI in the Fall of 2010 and repeated a year later at Harvard. The lectures were aimed at mathematicians and mathematical physicists working in combinatorics,…
These are lecture notes of a course on Calogero-Moser systems and their connections with representation theory and geometry, given by the author in Zurich in May-June 2005.
These lecture notes give an introduction to the theory of interacting particle systems. The main subjects are the construction using generators and graphical representations, the mean field limit, stochastic order, duality, and the relation…
We extend Approval voting to the settings where voters may have intransitive preferences. The major obstacle to applying Approval voting in these settings is that voters are not able to clearly determine who they should approve or…
This document serves as a brief overview of the "Safe and Reliable Machine Learning" tutorial given at the 2019 ACM Conference on Fairness, Accountability, and Transparency (FAT* 2019). The talk slides can be found here:…
We demonstrate that machine learning enables the capability to infer an individual's propensity to vote from their past actions and attributes. This is useful for microtargeting voter outreach, voter education and get-out-the-vote (GOVT)…
Bots, software-controlled accounts that operate on social media, have been used to manipulate and deceive. We studied the characteristics and activity of bots around major political events, including elections in various countries. In this…
These notes are based on lectures at the PSSCMP/PiTP summer school that was held at Princeton University and the Institute for Advanced Study in July, 2015. They are devoted largely to topological phases of matter that can be understood in…
Influence Functions are a standard tool for attributing predictions to training data in a principled manner and are widely used in applications such as data valuation and fairness. In this work, we present realistic incentives to manipulate…
We analyze how numerical experiments regarding elections were conducted within the computational social choice literature (focusing on papers published in the IJCAI, AAAI, and AAMAS conferences). We analyze the sizes of the studied…
These lectures deal with the problem of inductive inference, that is, the problem of reasoning under conditions of incomplete information. Is there a general method for handling uncertainty? Or, at least, are there rules that could in…
These are notes of a graduate course on representations of non-compact semisimple Lie groups given by the author at MIT.
These lecture notes are meant to provide a pedagogical introduction, and present the latest theoretical and experimental developments on the physics of vortices in type II superconductors.
These notes deal with a few aspects of Lie algebras and Lie groups, including some matters related to exponentiation.
These lecture notes were prepared for a special topics course in the Department of Statistics at the University of Washington, Seattle. They comprise the first eight chapters of a book currently in progress.
This note is an extended version of my presentation at the "Focused Research Workshop on Exterior Di{\S}erential Systems and Lie Theory" held at the Fields Institute in Toronto, December 9-13, 2013. Some ideas and constructions of this note…
Lu and Boutilier proposed a novel approach based on "minimax regret" to use classical score based voting rules in the setting where preferences can be any partial (instead of complete) orders over the set of alternatives. We show here that…
These are notes based on a course that I gave at the University of Chicago in Fall 2016 on "Loop measures and the loop-erased random walk." This is not intended to be a comprehensive view but rather a personal selection of some key ideas…