output
19962026
most citedDynamic stochastic blockmodels for time-evolving social networks

253 citations

Showing cs.LGShow all

15 papers · 1 filter

cs.LG2026★ 3 cited

Learning from a single labeled face and a stream of unlabeled data

Branislav Kveton, Michal Valko

Face recognition from a single image per person is a challenging problem because the training sample is extremely small. We consider a variation of this problem. In our problem, we…

cs.LG2026★ 21 cited

Conditional anomaly detection with soft harmonic functions

Michal Valko, Branislav Kveton, Hamed Valizadegan +2

In this paper, we consider the problem of conditional anomaly detection that aims to identify data instances with an unusual response or a class label. We develop a new non-paramet…

cs.LG2019★ 4 cited

Matrix Completion in the Unit Hypercube via Structured Matrix Factorization

Emanuele Bugliarello, Swayambhoo Jain, Vineeth Rakesh

Several complex tasks that arise in organizations can be simplified by mapping them into a matrix completion problem. In this paper, we address a key challenge faced by our company…

cs.LG2018★ 27 cited

Wide Compression: Tensor Ring Nets

Wenqi Wang, Yifan Sun, Brian Eriksson +2

Deep neural networks have demonstrated state-of-the-art performance in a variety of real-world applications. In order to obtain performance gains, these networks have grown larger…

cs.LG2015★ 57 cited

Combinatorial Cascading Bandits

Branislav Kveton, Zheng Wen, Azin Ashkan +1

We propose combinatorial cascading bandits, a class of partial monitoring problems where at each step a learning agent chooses a tuple of ground items subject to constraints and re…

cs.LG2015★ 108 cited

Cascading Bandits: Learning to Rank in the Cascade Model

Branislav Kveton, Csaba Szepesvari, Zheng Wen +1

A search engine usually outputs a list of web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user…