research
∙
05/31/2020
Tree-Projected Gradient Descent for Estimating Gradient-Sparse Parameters on Graphs
We study estimation of a gradient-sparse parameter vector θ^* ∈ℝ^p, havi...
share
research
∙
10/22/2018
Alternating Linear Bandits for Online Matrix-Factorization Recommendation
We consider the problem of online collaborative filtering in the online ...
research
∙
10/09/2018
Deep supervised feature selection using Stochastic Gates
In this study, we propose a novel non-parametric embedded feature select...
research
∙
10/19/2017
Minimax Estimation of Bandable Precision Matrices
The inverse covariance matrix provides considerable insight for understa...
research
∙
04/24/2017
Learning from Comparisons and Choices
When tracking user-specific online activities, each user's preference is...
research
∙
03/08/2017
Scalable Greedy Feature Selection via Weak Submodularity
Greedy algorithms are widely used for problems in machine learning such ...
research
∙
03/08/2017
On Approximation Guarantees for Greedy Low Rank Optimization
We provide new approximation guarantees for greedy low rank matrix estim...
research
∙
10/30/2016
Super-resolution estimation of cyclic arrival rates
Exploiting the fact that most arrival processes exhibit cyclic behaviour...
research
∙
11/17/2015
Understanding Adversarial Training: Increasing Local Stability of Neural Nets through Robust Optimization
We propose a general framework for increasing local stability of Artific...
research
∙
09/08/2012
Rank Centrality: Ranking from Pair-wise Comparisons
The question of aggregating pair-wise comparisons to obtain a global ran...
research
∙
07/18/2012