| Publication | Date of Publication | Type |
|---|
A weakness measure for GR(1) formulae
Formal Methods | 2021-05-04 | Paper |
A weakness measure for GR(1) formulae
Formal Aspects of Computing | 2021-03-04 | Paper |
A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds
Theoretical Computer Science | 2020-01-29 | Paper |
| A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, and variational bounds | 2019-01-10 | Paper |
A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, and variational bounds
(available as arXiv preprint) | 2019-01-10 | Paper |
| Following the leader and fast rates in online linear prediction: curved constraint sets and other regularities | 2018-04-17 | Paper |
Following the leader and fast rates in online linear prediction: curved constraint sets and other regularities
(available as arXiv preprint) | 2018-04-17 | Paper |
Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding
IEEE Transactions on Signal Processing | 2017-09-08 | Paper |
Efficient Tracking of Large Classes of Experts
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Online Markov Decision Processes Under Bandit Feedback
IEEE Transactions on Automatic Control | 2017-05-16 | Paper |
Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
On Learning the Optimal Waiting Time
Lecture Notes in Computer Science | 2015-01-14 | Paper |
BoostingTree: parallel selection of weak learners in boosting, with application to ranking
Machine Learning | 2014-07-14 | Paper |
On-line sequential bin packing
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
High-dimensional random geometric graphs and their clique number
Electronic Journal of Probability | 2012-06-22 | Paper |
Quasi-Model-based control of type 1 diabetes mellitus
Journal of Electrical and Computer Engineering | 2012-05-09 | Paper |
| The on-line shortest path problem under partial monitoring | 2011-10-12 | Paper |
Efficient multi-start strategies for local search algorithms
Journal of Artificial Intelligence Research | 2011-08-02 | Paper |
Robust servo control of a novel type 1 diabetic model
Optimal Control Applications & Methods | 2011-06-22 | Paper |
Tracking the Best Quantizer
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Individual Convergence Rates in Empirical Vector Quantizer Design
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Codecell convexity in optimal entropy-constrained vector quantization
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Symbol-Based Modeling and Coding of Block Markov Sources
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The Shortest Path Problem Under Partial Monitoring
Learning Theory | 2007-09-14 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
On the spectrum of pairwise comparison matrices
Linear Algebra and its Applications | 2004-08-06 | Paper |
On the structure of optimal entropy-constrained scalar quantizers
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Optimal entropy-constrained scalar quantization of a uniform source
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
On the rate-distortion function of random vectors and stationary sources with mixed distributions
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
