Skip to main content
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
Search options not deleted user 9652
5 votes
Accepted

Reconstructing Euclidian space from distance matrix

Yes, this is studied, for example under the name multidimensional scaling. Basically, one eigenvalue decomposition of a suitable matrix (that depends on the distances) shows if the data can be realize …
Dirk's user avatar
  • 12.7k
1 vote

Is it possible to “solve” iterative (convex/non-convex) optimization problems via learning (...

The specific problem you gave has the property that for every given data $(A,b,y)$ there is exactly one $x$ that solves the problem. Hence, there a solution map $(A,b,y) \mapsto x$ mapping $\mathbb{R} …
Dirk's user avatar
  • 12.7k
3 votes

When does the optimal model exist in learning theory?

Existence of minimizers is studied in the context of calculus of variations. There is quite some theory about it. The so called "direct method" goes as follows Choose a topology on the hypothesis spa …
Dirk's user avatar
  • 12.7k
7 votes

Mathematics of GANs (generative adversarial networks)

I recommend some papers by Lars Mescheder: The paper The Numerics of GANs formalizes GANs as two-player games and analyzes their training dynamics, the paper Which Training Methods for GANs do actual …
Dirk's user avatar
  • 12.7k