Levente Kocsis
Research Subjects
Levente Kocsis has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Andras A. Benczur
Hungarian Academy of Sciences (MTA SZTAKI)
1 shared publication - Andrea Nandorine Ban
Renal Research Institute, New York, New York
1 shared publication - András György
DeepMind London UK
1 shared publication - András György
Machine Learning Research Group Computer and Automation Research Institute Data Mining and Web Search Research Group Hungarian Academy of Sciences 1111 Budapest Hungary
1 shared publication - Csaba Szepesvári
Computer and Automation Research Inst. of the Hungarian Academy of Sciences
1 shared publication - Erzsébet Frigó
Institute for Computer Science and Control (SZTAKI), Eötvös Loránd Research Network (ELKH), Budapest, Hungary
1 shared publication
Latest Publications
- Open Access
- 6 November 2021
- Published by Springer Nature in User Modeling and User-Adapted Interaction
- Vol. 32 (4) , 649-683
Online convex combination of ranking models
As a task of high importance for recommender systems, we consider the problem of learning the convex combination of ranking algorithms by online machine learning. First, we propose a stochastic optimization algorithm that uses finite differences. Our new algorithm achieves close to optimal empirical performance for two base rankers, while scaling well with an increased number of models. In our experiments with five real-world recommendation data sets, we show that the combination offers significant improvement over previously known stochastic optimization techniques. The proposed algorithm is the first effective stochastic optimization method for combining ranked recommendation lists by online machine learning. Secondly, we propose an exponentially weighted algorithm based on a grid over the space of combination weights. We show that the algorithm has near-optimal worst-case performance bound. The bound provides the first theoretical guarantee for non-convex bandits using limited number of evaluations under very general conditions.
- 6 November 2021
- Published by Springer Nature in User Modeling and User-Adapted Interaction
- Vol. 32 (4) , 649-683
Open AccessOnline convex combination of ranking models
As a task of high importance for recommender systems, we consider the problem of learning the convex combination of ranking algorithms by online machine learning. First, we propose a stochastic optimization algorithm that uses finite differences. Our new algorithm achieves close to optimal empirical performance for two base rankers, while scaling well with an increased number of models. In our experiments with five real-world recommendation data sets, we show that the combination offers significant improvement over previously known stochastic optimization techniques. The proposed algorithm is the first effective stochastic optimization method for combining ranked recommendation lists by online machine learning. Secondly, we propose an exponentially weighted algorithm based on a grid over the space of combination weights. We show that the algorithm has near-optimal worst-case performance bound. The bound provides the first theoretical guarantee for non-convex bandits using limited number of evaluations under very general conditions.
- Open Access
Efficient Multi-Start Strategies for Local Search Algorithms
Local search algorithms applied to optimization problems often suffer from getting trapped in a local optimum. The common solution for this deficiency is to restart the algorithm when no progress is observed. Alternatively, one can start multiple instances of a local search algorithm, and allocate computational resources (in particular, processing time) to the instances depending on their behavior. Hence, a multi-start strategy has to decide (dynamically) when to allocate additional resources to a particular instance and when to start new instances. In this paper we propose multi-start strategies motivated by works on multi-armed bandit problems and Lipschitz optimization with an unknown constant. The strategies continuously estimate the potential performance of each algorithm instance by supposing a convergence rate of the local search algorithm up to an unknown constant, and in every phase allocate resources to those instances that could converge to the optimum for a particular range of the constant. Asymptotic bounds are given on the performance of the strategies. In particular, we prove that at most a quadratic increase in the number of times the target function is evaluated is needed to achieve the performance of a local search algorithm started from the attraction region of the optimum. Experiments are provided using SPSA (Simultaneous Perturbation Stochastic Approximation) and k-means as local search algorithms, and the results indicate that the proposed strategies work well in practice, and, in all cases studied, need only logarithmically more evaluations of the target function as opposed to the theoretically suggested quadratic increase.
Open AccessEfficient Multi-Start Strategies for Local Search Algorithms
Local search algorithms applied to optimization problems often suffer from getting trapped in a local optimum. The common solution for this deficiency is to restart the algorithm when no progress is observed. Alternatively, one can start multiple instances of a local search algorithm, and allocate computational resources (in particular, processing time) to the instances depending on their behavior. Hence, a multi-start strategy has to decide (dynamically) when to allocate additional resources to a particular instance and when to start new instances. In this paper we propose multi-start strategies motivated by works on multi-armed bandit problems and Lipschitz optimization with an unknown constant. The strategies continuously estimate the potential performance of each algorithm instance by supposing a convergence rate of the local search algorithm up to an unknown constant, and in every phase allocate resources to those instances that could converge to the optimum for a particular range of the constant. Asymptotic bounds are given on the performance of the strategies. In particular, we prove that at most a quadratic increase in the number of times the target function is evaluated is needed to achieve the performance of a local search algorithm started from the attraction region of the optimum. Experiments are provided using SPSA (Simultaneous Perturbation Stochastic Approximation) and k-means as local search algorithms, and the results indicate that the proposed strategies work well in practice, and, in all cases studied, need only logarithmically more evaluations of the target function as opposed to the theoretically suggested quadratic increase.
- 7 June 2013
- Published by Springer Nature in Machine Learning
- Vol. 93 (2-3) , 293-320
BoostingTree: parallel selection of weak learners in boosting, with application to ranking
- 7 June 2013
- Published by Springer Nature in Machine Learning
- Vol. 93 (2-3) , 293-320
BoostingTree: parallel selection of weak learners in boosting, with application to ranking
- 28 March 2006
- Published by Springer Nature in Machine Learning
- Vol. 63 (3) , 249-286
Universal parameter optimisation in games based on SPSA
- 28 March 2006
- Published by Springer Nature in Machine Learning
- Vol. 63 (3) , 249-286
Universal parameter optimisation in games based on SPSA