
Regret Bounds and Regimes of Optimality for UserUser and ItemItem Collaborative Filtering
We consider an online model for recommendation systems, with each user b...
read it

Learning a TreeStructured Ising Model in Order to Make Predictions
We study the problem of learning a tree graphical model from samples suc...
read it

Hardness of parameter estimation in graphical models
We consider the problem of learning the canonical parameters specifying ...
read it

Structure learning of antiferromagnetic Ising models
In this paper we investigate the computational complexity of learning th...
read it

Efficiently learning Ising models on arbitrary graphs
We consider the problem of reconstructing the graph underlying an Ising ...
read it

A Latent Source Model for Online Collaborative Filtering
Despite the prevalence of collaborative filtering in recommendation syst...
read it

Learning graphical models from the Glauber dynamics
In this paper we consider the problem of learning undirected graphical m...
read it

Stein's Method for Stationary Distributions of Markov Chains and Application to Ising Models
We develop a new technique, based on Stein's method, for comparing two s...
read it

Optimal Single Sample Tests for Structured versus Unstructured Network Data
We study the problem of testing, using only a single sample, between mea...
read it

Information Storage in the Stochastic Ising Model
Most information systems store data by modifying the local state of matt...
read it

Learning Restricted Boltzmann Machines via Influence Maximization
Graphical models are a rich language for describing highdimensional dis...
read it

Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure
The prototypical highdimensional statistics problem entails finding a s...
read it

Sparse PCA from Sparse Linear Regression
Sparse Principal Component Analysis (SPCA) and Sparse Linear Regression ...
read it

Universality of Computational Lower Bounds for Submatrix Detection
In the general submatrix detection problem, the task is to detect the pr...
read it

The AverageCase Complexity of Counting Cliques in ErdősRényi Hypergraphs
The complexity of clique problems on ErdosRenyi random graphs has becom...
read it

Optimal AverageCase Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness
In the past decade, sparse principal component analysis has emerged as a...
read it

Phase Transitions for Detecting Latent Geometry in Random Graphs
Random graphs with latent geometric structure are popular models of soci...
read it

AverageCase Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries
This paper develops several averagecase reduction techniques to show ne...
read it

A Corrective View of Neural Networks: Representation, Memorization and Learning
We develop a corrective mechanism for neural network approximation: the ...
read it

Reducibility and StatisticalComputational Gaps from Secret Leakage
Inference problems with conjectured statisticalcomputational gaps are u...
read it
Guy Bresler
is this you? claim profile