102 citations · 215 across the 26 of their papers we have counts for
5 papers · 1 filter
Belief Propagation Min-Sum Algorithm for Generalized Min-Cost Network Flow
Andrii Riazanov, Yury Maximov, Michael Chertkov
Belief Propagation algorithms are instruments used broadly to solve graphical model optimization and statistical inference problems. In the general case of a loopy Graphical Model,…
Importance sampling the union of rare events with an application to power systems analysis
Art B. Owen, Yury Maximov, Michael Chertkov
We consider importance sampling to estimate the probability of a union of rare events defined by a random variable . The sampler we study has been use…
Efficient Rank Minimization to Tighten Semidefinite Programming for Unconstrained Binary Quadratic Optimization
Roman Pogodin, Mikhail Krechetov, Yury Maximov
We propose a method for low-rank semidefinite programming in application to the semidefinite relaxation of unconstrained binary quadratic problems. The method improves an existing…
Representation Learning and Pairwise Ranking for Implicit Feedback in Recommendation Systems
Sumit Sidana, Mikhail Trofimov, Oleg Horodnitskii +3
In this paper, we propose a novel ranking framework for collaborative filtering with the overall aim of learning user preferences over items by minimizing a pairwise ranking loss.…
Aggressive Sampling for Multi-class to Binary Reduction with Applications to Text Classification
Bikash Joshi, Massih-Reza Amini, Ioannis Partalas +2
We address the problem of multi-class classification in the case where the number of classes is very large. We propose a double sampling strategy on top of a multi-class to binary…