Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with machine-learning
Search options not deleted
user 12623
Questions about computer algorithms that automatically discover patterns in data and make good decisions based on them.
2
votes
Why is the inner product of -1,+1 binary variables at most $n-2$ and not at most $n-1$?
I just noticed that if we have one disagreement then we change one single entry from +1 to -1. Thus, the summation decrease by 1 because we are missing one of the +1's in the summation but on top of t …
- 3,090
2
votes
1
answer
221
views
Why is the inner product of -1,+1 binary variables at most $n-2$ and not at most $n-1$?
In short, if $x \neq u_i \in \{\pm1 \}^n$ then why is:
$$ \langle x, u_i \rangle \leq n-2 $$
but not:
$$ \langle x, u_i \rangle \leq n-1 $$
?
To add context:
I was reading understanding machin …
- 3,090
1
vote
0
answers
77
views
What are good examples of computational theories for A.I. according to David Marr's Definition?
I was reading David Marr's "Artificial Intelligence-A Personal View" and he talks about "computational theory of AI" or what he laters labels as "Type 1" Theory. He provides the example of Chomsky's n …
- 3,090
0
votes
If we can $\epsilon-$cover one set with $\frac{K}{2}$ elements and another with 2 elements w...
I think the answer is easiest to explain with an example. Say that we want to cover $T = \{ t_1, t_2,t_3 \}$ (where $t_i$ can just be $R^d$ vectors). Say the distance between the $t_i$'s is 1 and that …
- 3,090
2
votes
1
answer
530
views
How to transform an Abstract Syntax Tree (AST) to an Abstract Binding Tree (ABT)? (for machi...
I was reading the HOList paper that applies Graph Neural Networks (GNNs) to the HOL Light (HOList) data set and benchmark for ML for theorem proving. They describe their results etc but there is no co …
- 3,090
1
vote
2
answers
73
views
If we can $\epsilon-$cover one set with $\frac{K}{2}$ elements and another with 2 elements w...
I was reading the following paper on Robustness and Generalization (and covering numbers)and I was reading their example 1:
which didn't quite make sense to me. The reason it didn't make sense is tha …
- 3,090
1
vote
0
answers
73
views
Good pointers to learn foundations of Program induction and Program synthesis
I was interested in learning more about program induction and program synthesis. I was especially interested in learning about how to form program from data for example. My background is in traditiona …
- 3,090
1
vote
1
answer
91
views
Why does it take O(n!) time to specify a canonical ordering for learning flatten adjacency m...
I was reading a paper for learning graphs (paper is GraphRNN) and it says in section 2.2 (emphasis by me):
Vector-representation based models. One naive approach would be to represent G by flattening …
- 3,090