UB Paderborn / Katalog / Suche / in CDI

A Combinatorial, Primal-Dual Approach to Semidefinite Programs

Journal of the ACM, 2016-05, Vol.63 (2), p.1-35

2016

Volltextzugriff (PDF)

Logarithmic regret algorithms for online convex optimization

Machine learning, 2007-12, Vol.69 (2-3), p.169-192

2007

Volltextzugriff (PDF)

Near-Optimal Algorithms for Online Matrix Prediction

SIAM journal on computing, 2017-01, Vol.46 (2), p.744-773

2017

Volltextzugriff (PDF)

Extracting certainty from uncertainty: regret bounded by variation in costs

Machine learning, 2010-09, Vol.80 (2-3), p.165-188

2010

Volltextzugriff (PDF)

Logarithmic Regret Algorithms for Online Convex Optimization

Learning Theory, 2006, p.499-513

2006

Volltextzugriff (PDF)

AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION

Mathematical finance, 2015-04, Vol.25 (2), p.288-310

2015

Volltextzugriff (PDF)

Online learning of quantum states

Journal of statistical mechanics, 2019-12, Vol.2019 (12), p.124019

2019

Volltextzugriff (PDF)

A combinatorial, primal-dual approach to semidefinite programs

Annual ACM Symposium on Theory of Computing: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing; 11-13 June 2007, 2007, p.227-236

2007

Volltextzugriff (PDF)

O(√log n) APPROXIMATION TO SPARSEST CUT IN Õ(n2) TIME

SIAM journal on computing, 2010, Vol.39 (5), p.1748-1771

2010

Volltextzugriff (PDF)

Learning rotations with little regret

Machine learning, 2016-07, Vol.104 (1), p.129-148

2016

Volltextzugriff (PDF)

A Fast Random Sampling Algorithm for Sparsifying Matrices

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2006, p.272-279

2006

Volltextzugriff (PDF)

Extracting certainty from uncertainty: regret bounded byvariation incosts

Machine learning, 2010-09, Vol.80 (2-3), p.165-188

2010

Volltextzugriff (PDF)

Extracting certainty from uncertainty: regret bounded by variation in costs: Special Issue on Learning Theory

Machine learning, 2010, Vol.80 (2-3), p.165-188

2010

Volltextzugriff (PDF)

A variation on SVD based image compression

Image and vision computing, 2007-06, Vol.25 (6), p.771-777

2007

Volltextzugriff (PDF)

Online learning of quantum statesThis article is an updated version of: Aaronson S, Chen X, Hazan E, Kale S and Nayak A 2018 Online learning of quantum states Advances in Neural Information Processing Systems 31 ed S Bengio, H Wallach, H Larochelle, K Grauman, N Cesa-Bianchi and R Garnett (Red Hook, NY: Curran Associates, Inc.) pp 8962-72

Journal of statistical mechanics, 2019-12, Vol.2019 (12)

2019

Volltextzugriff (PDF)

AN EXPANSION TESTER FOR BOUNDED DEGREE GRAPHS

SIAM journal on computing, 2011-01, Vol.40 (3), p.709-720

2011

Volltextzugriff (PDF)

Noise Tolerance of Expanders and Sublinear Expansion Reconstruction

SIAM journal on computing, 2013-01, Vol.42 (1), p.305-323

2013

Volltextzugriff (PDF)

O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time

SIAM journal on computing, 2010-01, Vol.39 (5), p.1748-1771

2010

Volltextzugriff (PDF)

Who moderates the moderators?: crowdsourcing abuse detection in user-generated content

Proceedings of the 12th ACM conference on Electronic commerce, 2011, p.167-176

2011

Volltextzugriff (PDF)

Privacy, accuracy, and consistency too: a holistic solution to contingency table release

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2007, p.273-282

2007

Volltextzugriff (PDF)

The Approximability of the Binary Paintshop Problem

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, p.205-217

Volltextzugriff (PDF)

An Expansion Tester for Bounded Degree Graphs

Automata, Languages and Programming, Vol.5125, p.527-538

Volltextzugriff (PDF)

Efficient algorithms using the Multiplicative Weights Update method

Kale, Satyen

2007

Volltextzugriff (PDF)

Efficient algorithms using the Multiplicative Weights Update method

Kale, Satyen

2007

Volltextzugriff (PDF)

Algorithms for portfolio management based on the Newton method

ACM International Conference Proceeding Series; Vol. 148: Proceedings of the 23rd international conference on Machine learning; 25-29 June 2006, 2006, p.9-16

2006

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

A Combinatorial, Primal-Dual Approach to Semidefinite Programs

Logarithmic regret algorithms for online convex optimization

Near-Optimal Algorithms for Online Matrix Prediction

Extracting certainty from uncertainty: regret bounded by variation in costs

Logarithmic Regret Algorithms for Online Convex Optimization

AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION

Online learning of quantum states

A combinatorial, primal-dual approach to semidefinite programs

O(√log n) APPROXIMATION TO SPARSEST CUT IN Õ(n2) TIME

Learning rotations with little regret

A Fast Random Sampling Algorithm for Sparsifying Matrices

Extracting certainty from uncertainty: regret bounded byvariation incosts

Extracting certainty from uncertainty: regret bounded by variation in costs: Special Issue on Learning Theory

A variation on SVD based image compression

AN EXPANSION TESTER FOR BOUNDED DEGREE GRAPHS

Noise Tolerance of Expanders and Sublinear Expansion Reconstruction

O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time

Who moderates the moderators?: crowdsourcing abuse detection in user-generated content

Privacy, accuracy, and consistency too: a holistic solution to contingency table release

The Approximability of the Binary Paintshop Problem

An Expansion Tester for Bounded Degree Graphs

Efficient algorithms using the Multiplicative Weights Update method

Efficient algorithms using the Multiplicative Weights Update method

Algorithms for portfolio management based on the Newton method

Suchergebnisse filtern