71 citations · 115 across the 4 of their papers we have counts for
4 papers
k*-Nearest Neighbors: From Global to Local
Oren Anava, Kfir Y. Levy
The weighted k-nearest neighbors algorithm is one of the most fundamental non-parametric methods in pattern recognition and machine learning. The question of setting the optimal nu…
Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design
Oren Anava, Shahar Golan, Nadav Golbandi +4
It is well known that collaborative filtering (CF) based recommender systems provide better modeling of users and items associated with considerable rating history. The lack of his…
Online Learning for Time Series Prediction
Oren Anava, Elad Hazan, Shie Mannor +1
In this paper we address the problem of predicting a time series using the ARMA (autoregressive moving average) model, under minimal assumptions on the noise terms. Using regret mi…
Online Convex Optimization Against Adversaries with Memory and Application to Statistical Arbitrage
Oren Anava, Elad Hazan, Shie Mannor
The framework of online learning with memory naturally captures learning problems with temporal constraints, and was previously studied for the experts setting. In this work we ext…