# Tag Info

### any hope for a universal automatic parser?

You might be interested in learning about grammar induction: given a set of examples of strings from a context-free language, there are algorithms to learn a context-free grammar that generates those ...

### Are there improvements on Dana Angluin's algorithm for learning regular sets

I do not know if my answer is still relevant. Recently it has been described the implementation of a new algorithm called Observation Pack or in some circumstances Discrimination Tree by Falk Howar. ...
Accepted

### Is it true that PAC is a subset of agnostic PAC?

The trivial implication is: $\mathcal{C}\subseteq 2^\mathcal{X}$ is agnostic PAC learnable $\Rightarrow$ $\mathcal{C}$ is PAC learnable Intuitively, being agnostic PAC learnable is a stronger ...
Accepted

### Does selecting the same arm has the same reward?

In the version of the Multi-Armed Bandit problem I'm familiar with, there is a fixed list of distributions $B = R_1, R_2 \cdots R_n$, and the reward for pulling lever $k$ is chosen from the ...
Accepted

### AdaBoost - why using such alpha function?

Recall that the final hypothesis after $T$ rounds is $h_T(x)=sign\left(\sum\limits_{i=1}^T \alpha_t h_t(x)\right)$, i.e. $\alpha_t$ is the weight of $h_t$ in $h_T$. If $\epsilon_t$ is high (near one) ...
Accepted

### Labeled points in $\{0,1\}^n$ such that every linear separator requires exponential weights

Håstad gave an even better example in his paper On the Size of Weights for Threshold Gates, which requires super exponential weights. A simple example which requires exponential weights is the ...
Accepted

### What does it mean the norm symbol applied to a concept?

The only property that the functions $|\cdot|$ and $\|\cdot\|$ need to satisfy is that for every $n$ there is a finite number of $x$'s in the domain such that $|x|=n$ or $\|x\|=n$. The difference ...
Accepted

### VC dimension of the class of polynomial classifiers of degree $n$

The idea is that a polynomial of degree $n$ has at most $n$ roots, and so can change signs at most $n$ times. Therefore no polynomial of degree $n$ can form an alternating pattern +-+-... or -+-+... ...
Accepted

1 vote
Accepted

### Dana Angluin's L* algorithm - Hypothesis inconsistent

I have no idea what it would mean for a hypothesis to be inconsistent in this context, but the answer to your second question is: No. You won't receive the same counterexample twice. The teacher ...
1 vote

### what does this phrase mean: "train a policy network"

A policy is just a response or action given a state (situation). Training a neural network with samples from an expert is just searching for a function F that efficiently maps states to actions. For ...

Only top scored, non community-wiki answers of a minimum length are eligible