×

Found 24 Documents (Results 1–24)

Competing bandits: learning under competition. (English) Zbl 1462.68160

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 48, 27 p. (2018).
MSC:  68T05 91A26 91A60
PDFBibTeX XMLCite
Full Text: DOI arXiv

Robust inference for multiclass classification. (English) Zbl 1405.68287

Janoos, Firdaus (ed.) et al., Algorithmic learning theory 2018. Proceedings of the 29th international conference (ALT 2018), Lanzarote, Spain, April 7–9, 2018. [s.l.]: Proceedings of Machine Learning Research PMLR. Proceedings of Machine Learning Research (PMLR) 83, 368-386 (2018).
MSC:  68T05 62H30 91A26
PDFBibTeX XMLCite
Full Text: Link

History-independent distributed multi-agent learning. (English) Zbl 1403.91285

Gairing, Martin (ed.) et al., Algorithmic game theory. 9th international symposium, SAGT 2016, Liverpool, UK, September 19–21, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-53353-6/pbk; 978-3-662-53354-3/ebook). Lecture Notes in Computer Science 9928, 77-89 (2016).
MSC:  91D30 91A26
PDFBibTeX XMLCite
Full Text: DOI

Simple adaptive strategies. From regret-matching to uncoupled dynamics. With the collaboration of Yakov Babichenko, Amotz Cahn, Yishay Mansour and David Schmeidler. (English) Zbl 1298.91019

World Scientific Series in Economic Theory 4. Hackensack, NJ: World Scientific (ISBN 978-981-4390-69-9/hbk; 978-981-4401-59-3/ebook). xxxviii, 296 p. (2013).
PDFBibTeX XMLCite
Full Text: DOI

On the convergence of regret minimization dynamics in concave games. (English) Zbl 1304.91015

Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09. Bethesda, MD, USA, May 31 – June 2, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-613-7). 523-532 (2009).
MSC:  91A06 91A22
PDFBibTeX XMLCite
Full Text: DOI

On agnostic boosting and parity learning. (English) Zbl 1231.68204

STOC’08. Proceedings of the 40th annual ACM symposium on theory of computing 2008, Victoria, Canada, May 17–20, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-047-0). 629-638 (2008).
MSC:  68T05 68Q32
PDFBibTeX XMLCite

Learning with attribute costs. (English) Zbl 1192.68392

STOC’05: Proceedings of the 37th annual ACM symposium on theory of computing, Baltimore, MD, USA, May 22–24, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-960-8). 356-365 (2005).
MSC:  68Q32
PDFBibTeX XMLCite
Full Text: DOI

From external to internal regret. (English) Zbl 1137.68523

Auer, Peter (ed.) et al., Learning theory. 18th annual conference on learning theory, COLT 2005, Bertinoro, Italy, June 27–30, 2005. Proceedings. Berlin: Springer (ISBN 3-540-26556-2/pbk). Lecture Notes in Computer Science 3559. Lecture Notes in Artificial Intelligence, 621-636 (2005).
MSC:  68T05 90B50 91A26
PDFBibTeX XMLCite
Full Text: DOI

Concentration bounds for unigrams language model. (English) Zbl 1078.68048

Shawe-Taylor, John (ed.) et al., Learning theory. 17th annual conference on learning theory, COLT 2004, Banff, Canada, July 1–4, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22282-0/pbk). Lecture Notes in Computer Science 3120. Lecture Notes in Artificial Intelligence, 170-185 (2004).
MSC:  68Q32 68T50
PDFBibTeX XMLCite
Full Text: DOI

PAC bounds for multi-armed bandit and Markov decision processes. (English) Zbl 1050.68059

Kivinen, Jyrki (ed.) et al., Computational learning theory. 15th annual conference, COLT 2002, Sydney, Australia, July 8–10, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43836-X). Lect. Notes Comput. Sci. 2375, 255-270 (2002).
MSC:  68Q32 90C40
PDFBibTeX XMLCite
Full Text: Link

Learning rates for Q-learning. (English) Zbl 0992.68097

Helmbold, David (ed.) et al., Computational learning theory. 14th annual conference, COLT 2001, and 5th European conference, EuroCOLT 2001, Amsterdam, Netherlands, July 16-19, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2111, 589-604 (2001).
MSC:  68Q32
PDFBibTeX XMLCite
Full Text: Link

Weakly learning DNF and characterizing statistical query learning using Fourier analysis. (English) Zbl 1345.68186

Proceedings of the 26th annual ACM symposium on theory of computing, STOC ’94, Montreal, Canada, May 23–25, 1994. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-663-8). 253-262 (1994).
MSC:  68Q32 68T05
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software