Search Results for author:
Found 8 papers, 2 papers with code
Approximating a RUM from Distributions on k-Slates
In this work we consider the problem of fitting Random Utility Models (RUMs) to user choices.
About latent roles in forecasting players in team sports
Forecasting players in sports has grown in popularity due to the potential for a tactical advantage and the applicability of such research to multi-agent interaction systems.
Online Facility Location with Multiple Advice
Clustering is a central topic in unsupervised learning and its online formulation has received a lot of attention in recent years.
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models
We study the reconstruction version of this problem in which one is seeking to reconstruct a latent clustering that has been corrupted by random noise and adversarial modifications.
OLIVAW: Mastering Othello without Human Knowledge, nor a Fortune
We introduce OLIVAW, an AI Othello player adopting the design principles of the famous AlphaGo programs.
Motivo: fast motif counting via succinct color coding and adaptive sampling
To give an idea of the improvements, in $40$ minutes Motivo counts $7$-nodes motifs on a graph with $65$M nodes and $1. 8$B edges; this is $30$ and $500$ times larger than the state of the art, respectively in terms of nodes and edges.
A Reduction for Efficient LDA Topic Reconstruction
We present a novel approach for LDA (Latent Dirichlet Allocation) topic reconstruction.
Trainyard is NP-Hard
Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity.
Computational Complexity
