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
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
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 Search options user 60456

Questions about problems that entail selecting the best element from some set of available alternatives, and methods to solve them.

0
votes
. Then, formulate your problem as an optimization that's a function of $N$, the number of nearest neighbors you will compute. To get there, we can do the following with the cost function: \begin{align … {1}{N}\sum_{i \in S_N} v_i$ close to $\frac{-w}{N}$ and in turn help minimize the norm. The resulting optimization then ends up being: \begin{align} N^{*} = \arg \min_{N} N^2 \left\lVert \frac{w}{N …
answered May 24 '17 by spektr
1
vote
of the current sum ($s_{n}$) and $n^{th}$ chosen sequence term value ($u_{n}$). We can break this into pieces and recursively solve the optimization by doing the following: \begin{align} V^{*}_{M+1}(s …
answered Mar 5 '17 by spektr