×

Found 61 Documents (Results 1–61)

100
MathJax

Time-space lower bounds for two-pass learning. (English) Zbl 07564422

Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 22, 39 p. (2019).
MSC:  68Q25
PDF BibTeX XML Cite
Full Text: DOI

Learning under \(p\)-tampering attacks. (English) Zbl 1405.68297

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, 572-596 (2018).
MSC:  68T05 68P25 68W20
PDF BibTeX XML Cite
Full Text: arXiv Link

Optimal quantum sample complexity of learning algorithms. (English) Zbl 1440.68096

O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 25, 31 p. (2017).
MSC:  68Q12 68Q32 81P68
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the power of learning from \(k\)-wise queries. (English) Zbl 1402.68111

Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 41, 32 p. (2017).
MSC:  68Q32 68Q10 68Q25
PDF BibTeX XML Cite
Full Text: DOI arXiv

Time-space hardness of learning sparse parities. (English) Zbl 1370.68132

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 1067-1080 (2017).
PDF BibTeX XML Cite
Full Text: DOI

On the evolution of monotone conjunctions: drilling for best approximations. (English) Zbl 1478.68284

Ortner, Ronald (ed.) et al., Algorithmic learning theory. 27th international conference, ALT 2016, Bari, Italy, October 19–21, 2016, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9925, 98-112 (2016).
PDF BibTeX XML Cite
Full Text: DOI

A PAC approach to application-specific algorithm selection. (English) Zbl 1334.68292

Proceedings of the 7th ACM conference on innovations in theoretical computer science, ITCS’16, Cambridge, MA, USA, January 14–16, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4057-1). 123-134 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Learning circuits with few negations. (English) Zbl 1375.68063

Garg, Naveen (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 18th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2015) and the 19th international workshop on randomization and computation (RANDOM 2015), Princeton, NJ, USA, August 24–26, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-89-7). LIPIcs – Leibniz International Proceedings in Informatics 40, 512-527 (2015).
MSC:  68Q25 68T05 94C10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Restricted distribution automatizability in PAC-semantics. (English) Zbl 1366.68241

Proceedings of the 6th conference on innovations in theoretical computer science, ITCS’15, Rehovot, Israel, January 11–13, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3333-7). 93-102 (2015).
MSC:  68T05 03F20 68Q25
PDF BibTeX XML Cite
Full Text: DOI Link

A survey of preference-based online learning with bandit algorithms. (English) Zbl 1432.68380

Auer, Peter (ed.) et al., Algorithmic learning theory. 25th international conference, ALT 2014, Bled, Slovenia, October 8–10, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8776, 18-39 (2014).
MSC:  68T05 68W27
PDF BibTeX XML Cite
Full Text: DOI

A unified framework for approximating and clustering data. (English) Zbl 1288.90046

Proceedings of the 43rd annual ACM symposium on theory of computing, STOC ’11. San Jose, CA, USA, June 6–8, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0691-1). 569-578 (2011).
MSC:  68T10 62H30 68W25
PDF BibTeX XML Cite
Full Text: DOI Link

Algorithms for reinforcement learning. (English) Zbl 1205.68320

Synthesis Lectures on Artificial Intelligence and Machine Learning 9. San Rafael, CA: Morgan & Claypool Publishers (ISBN 978-1-60845-492-1/pbk; 978-1-60845-493-8/ebook). xiii, 89 p. (2010).
PDF BibTeX XML Cite
Full Text: DOI

Sublinear time approximate clustering. (English) Zbl 0987.68068

Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 439-447 (2001).
MSC:  68T05
PDF BibTeX XML Cite

A new composition theorem for learning algorithms. (English) Zbl 1028.68134

STOC ’98. Proceedings of the 30th annual ACM symposium on theory of computing, Dallas, TX, USA, May 23-26, 1998. New York, NY: ACM, Association for Computing Machinery. 583-589 (1998).
MSC:  68T05 68W05
PDF BibTeX XML Cite

Relationships between PAC-learning algorithms and weak Occam algorithms. (English) Zbl 0869.68074

Arikawa, S. (ed.) et al., Algorithmic learning theory II. Selected papers of the workshop, ALT ’91, October 23–25, 1991, Tokyo, Japan. Amsterdam: IOS Press. 151-162 (1992).
MSC:  68T05
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification

all top 3

Software