Search Results for author:
Found 6 papers, 3 papers with code
Best Arm Identification with Fixed Budget: A Large Deviation Perspective
In particular, we present \sred (Continuous Rejects), a truly adaptive algorithm that can reject arms in {\it any} round based on the observed empirical gaps between the rewards of various arms.
Improved analysis of randomized SVD for top-eigenvector approximation
We present a novel analysis of the randomized SVD algorithm of \citet{halko2011finding} and derive tight bounds in many cases of interest.
Fast Pure Exploration via Frank-Wolfe
For this problem, instance-specific lower bounds on the expected sample complexity reveal the optimal proportions of arm draws an Oracle algorithm would apply.
Discovering conflicting groups in signed networks
In this paper we study the problem of detecting $k$ conflicting groups in a signed network.
Ego-CNN: Distributed, Egocentric Representations of Graphs for Detecting Critical Structures
We study the problem of detecting critical structures using a graph embedding model.
Ego-CNN: An Ego Network-based Representation of Graphs Detecting Critical Structures
While existing graph embedding models can generate useful embedding vectors that perform well on graph-related tasks, what valuable information can be jointly learned by a graph embedding model is less discussed.
