309,623 research outputs found
Quantum Recommendation Systems
A recommendation system uses the past purchases or ratings of products by
a group of users, in order to provide personalized recommendations to
individual users. The information is modeled as an preference
matrix which is assumed to have a good rank- approximation, for a small
constant .
In this work, we present a quantum algorithm for recommendation systems that
has running time . All known classical
algorithms for recommendation systems that work through reconstructing an
approximation of the preference matrix run in time polynomial in the matrix
dimension. Our algorithm provides good recommendations by sampling efficiently
from an approximation of the preference matrix, without reconstructing the
entire matrix. For this, we design an efficient quantum procedure to project a
given vector onto the row space of a given matrix. This is the first algorithm
for recommendation systems that runs in time polylogarithmic in the dimensions
of the matrix and provides an example of a quantum machine learning algorithm
for a real world application.Comment: 22 page
Adversarially Robust Submodular Maximization under Knapsack Constraints
We propose the first adversarially robust algorithm for monotone submodular
maximization under single and multiple knapsack constraints with scalable
implementations in distributed and streaming settings. For a single knapsack
constraint, our algorithm outputs a robust summary of almost optimal (up to
polylogarithmic factors) size, from which a constant-factor approximation to
the optimal solution can be constructed. For multiple knapsack constraints, our
approximation is within a constant-factor of the best known non-robust
solution.
We evaluate the performance of our algorithms by comparison to natural
robustifications of existing non-robust algorithms under two objectives: 1)
dominating set for large social network graphs from Facebook and Twitter
collected by the Stanford Network Analysis Project (SNAP), 2) movie
recommendations on a dataset from MovieLens. Experimental results show that our
algorithms give the best objective for a majority of the inputs and show strong
performance even compared to offline algorithms that are given the set of
removals in advance.Comment: To appear in KDD 201
An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects
The Student-Project Allocation problem with preferences over Projects (SPA-P) involves sets of students, projects and lecturers, where the students and lecturers each have preferences over the projects. In this context, we typically seek a stable matching of students to projects (and lecturers). However, these stable matchings can have different sizes, and the problem of finding a maximum stable matching (MAX-SPA-P) is NP-hard. There are two known approximation algorithms for MAX-SPA-P, with performance guarantees of 2 and 32 . In this paper, we describe an Integer Programming (IP) model to enable MAX-SPA-P to be solved optimally. Following this, we present results arising from an empirical analysis that investigates how the solution produced by the approximation algorithms compares to the optimal solution obtained from the IP model, with respect to the size of the stable matchings constructed, on instances that are both randomly-generated and derived from real datasets. Our main finding is that the 32 -approximation algorithm finds stable matchings that are very close to having maximum cardinality
Approximate Matrix Multiplication with Application to Linear Embeddings
In this paper, we study the problem of approximately computing the product of
two real matrices. In particular, we analyze a dimensionality-reduction-based
approximation algorithm due to Sarlos [1], introducing the notion of nuclear
rank as the ratio of the nuclear norm over the spectral norm. The presented
bound has improved dependence with respect to the approximation error (as
compared to previous approaches), whereas the subspace -- on which we project
the input matrices -- has dimensions proportional to the maximum of their
nuclear rank and it is independent of the input dimensions. In addition, we
provide an application of this result to linear low-dimensional embeddings.
Namely, we show that any Euclidean point-set with bounded nuclear rank is
amenable to projection onto number of dimensions that is independent of the
input dimensionality, while achieving additive error guarantees.Comment: 8 pages, International Symposium on Information Theor
Certification of inequalities involving transcendental functions: combining SDP and max-plus approximation
We consider the problem of certifying an inequality of the form ,
, where is a multivariate transcendental function, and
is a compact semialgebraic set. We introduce a certification method, combining
semialgebraic optimization and max-plus approximation. We assume that is
given by a syntaxic tree, the constituents of which involve semialgebraic
operations as well as some transcendental functions like , ,
, etc. We bound some of these constituents by suprema or infima of
quadratic forms (max-plus approximation method, initially introduced in optimal
control), leading to semialgebraic optimization problems which we solve by
semidefinite relaxations. The max-plus approximation is iteratively refined and
combined with branch and bound techniques to reduce the relaxation gap.
Illustrative examples of application of this algorithm are provided, explaining
how we solved tight inequalities issued from the Flyspeck project (one of the
main purposes of which is to certify numerical inequalities used in the proof
of the Kepler conjecture by Thomas Hales).Comment: 7 pages, 3 figures, 3 tables, Appears in the Proceedings of the
European Control Conference ECC'13, July 17-19, 2013, Zurich, pp. 2244--2250,
copyright EUCA 201
- …