# Algorithmic learning theory

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2006

Highly Cited

2006

- Neural Computation
- 2006

We show how to use complementary priors to eliminate the explaining-away effects that make inference difficult in denselyâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- 2006

1. Types and Programming Languages by Benjamin C. Pierce. This is a book about implementing type systems in programming languagesâ€¦Â (More)

Is this relevant?

2003

2003

- Lecture Notes in Computer Science
- 2003

In the coming post IT era, the problems of signal extraction and knowledge discovery from huge data sets will become veryâ€¦Â (More)

Is this relevant?

2002

2002

- Lecture Notes in Computer Science
- 2002

Learning theoretic aspects of mathematics and logic have been studied by many authors. They study how mathematical and logicalâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Linguistic Inquiry
- 2001

The Gradual Learning Algorithm (Boersma 1997) is a constraint-ranking algorithm for learning optimality-theoretic grammars. Theâ€¦Â (More)

Is this relevant?

2000

2000

- ALT
- 2000

A sequential sampling algorithm or adaptive sampling algorithm is a sampling algorithm that obtains instances sequentially one byâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- ICML
- 1999

The application of boosting procedures to decision tree algorithms has been shown to produce very accurate classi ers. Theseâ€¦Â (More)

Is this relevant?

1999

1999

- Lecture Notes in Computer Science
- 1999

Designing the representation languages for the input and output of a learning algorithm is the hardest task within machineâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- ICML
- 1998

In this paper we study a dual version of the Ridge Regression procedure. It allows us to perform non-linear regression byâ€¦Â (More)

Is this relevant?

1994

1994

- New Generation Computing
- 1994

We present two phenomena which were discovered in pure recursion-theoretic inductive inference, namely inconsistent learningâ€¦Â (More)

Is this relevant?