Find link

language:

Find link is a tool written by Edward Betts.

searching for algorithmic learning theory 19 found (35 total)

alternate case: Algorithmic learning theory

Marcus Hutter (877 words) [view diff] case mismatch in snippet view article find links to article

Learning with Exploration" (PDF). Algorithmic Learning Theory. Proc. 25th International Conf. on Algorithmic Learning Theory ({ALT'14}). Lecture Notes in Computer

Bernhard Schölkopf (2,007 words) [view diff] case mismatch in snippet view article find links to article

and B. Schölkopf. A Hilbert Space Embedding for Distributions. Algorithmic Learning Theory: 18th International Conference: 13—31, 2007 B. Sriperumbudur

Teaching dimension (435 words) [view diff] case mismatch in snippet view article find links to article

and Sandra Zilles (2019). "Optimal collusion-free teaching". Algorithmic Learning Theory: 506–528. arXiv:1903.04012.{{cite journal}}: CS1 maint: multiple

Selection bias (2,257 words) [view diff] case mismatch in snippet view article find links to article

Rostamizadeh, Afshin (2008). "Sample Selection Bias Correction Theory". Algorithmic Learning Theory (PDF). Lecture Notes in Computer Science. Vol. 5254. pp. 38–53

Thomas G. Dietterich (2,778 words) [view diff] case mismatch in snippet view article find links to article

Dietterich, T. G. (2000). The Divide-and-Conquer Manifesto In Algorithmic Learning Theory 11th International Conference (ALT 2000) (pp. 13–26). New York:

Inductive programming (2,549 words) [view diff] case mismatch in snippet view article find links to article

induction of logic programs". Proceedings of the Workshop on Algorithmic Learning Theory. 6: 368–381. S2CID 14992676. Quinlan, J.R.; Cameron-Jones, R

Sampling bias (2,880 words) [view diff] case mismatch in snippet view article find links to article

Rostamizadeh A (2008). "Sample Selection Bias Correction Theory" (PDF). Algorithmic Learning Theory. Lecture Notes in Computer Science. Vol. 5254. pp. 38–53. arXiv:0805

Golem (ILP) (1,290 words) [view diff] case mismatch in snippet view article

Yokomori, Takashi (eds.). "Efficient Induction of Logic Programs". Algorithmic Learning Theory, First International Workshop, ALT '90, Tokyo, Japan, October

Grammar induction (2,166 words) [view diff] case mismatch in snippet view article find links to article

Li; A. Maruoka (eds.). Proc. 8th International Workshop on Algorithmic Learning Theory — ALT'97. LNAI. Vol. 1316. Springer. pp. 260–276. Hiroki Arimura;

Mathematical beauty (3,561 words) [view diff] case mismatch in snippet view article find links to article

LNAI 4755, Springer, 2007. Also in Proc. 18th Intl. Conf. on Algorithmic Learning Theory (ALT 2007) p. 32, LNAI 4754, Springer, 2007. Joint invited lecture

Peter Gacs (1,199 words) [view diff] case mismatch in snippet view article find links to article

arXiv:math/0006233[math.PR]. Short version with similar title in Algorithmic Learning Theory, LNCS 1968/2000. Aditi Dhagat, Peter Gacs, and Peter Winkler

Good–Turing frequency estimation (1,841 words) [view diff] case mismatch in snippet view article find links to article

"Offline to Online Conversion". Proc. 25th International Conf. on Algorithmic Learning Theory (ALT'14). LNAI. Vol. 8776. Bled, Slovenia: Springer. pp. 230–244

Inductive logic programming (4,248 words) [view diff] case mismatch in snippet view article find links to article

Yokomori, Takashi (eds.). "Efficient Induction of Logic Programs". Algorithmic Learning Theory, First International Workshop, ALT '90, Tokyo, Japan, October

Well-ordering principle (2,654 words) [view diff] case mismatch in snippet view article find links to article

Norma B.; Harizanov, Valentina S. (2007-08-21). Induction, Algorithmic Learning Theory, and Philosophy. Springer Science & Business Media. p. 147.

Klaus Peter Jantke (927 words) [view diff] case mismatch in snippet view article find links to article

ISSN 0302-9743 Arikawa, Setsuo; Jantke, Klaus P., eds. (Oct 1994), Algorithmic Learning Theory, Lecture Notes in Computer Science, vol. 872, Reinhardsbrunn

Solomonoff's theory of inductive inference (2,345 words) [view diff] case mismatch in snippet view article find links to article

existence and convergence of computable universal priors arxiv.org – Algorithmic Learning Theory, 2003 – Springer Samuel Rathmanner and Marcus Hutter. A philosophical

Differential privacy (5,184 words) [view diff] case mismatch in snippet view article find links to article

Benjamin Rubinstein. Robust and Private Bayesian Inference. Algorithmic Learning Theory 2014 Warner, S. L. (March 1965). "Randomised response: a survey

Exponential mechanism (3,031 words) [view diff] case mismatch in snippet view article find links to article

Benjamin Rubinstein. Robust and Private Bayesian Inference. Algorithmic Learning Theory 2014 Yu-Xiang Wang, Stephen E. Fienberg, Alex Smola Privacy for

Kernel embedding of distributions (9,770 words) [view diff] case mismatch in snippet view article find links to article

for Distributions Archived 2013-12-15 at the Wayback Machine. Algorithmic Learning Theory: 18th International Conference. Springer: 13–31. L. Song, K.