×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.

Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Click here to flash read.

We develop new tools to study landscapes in nonconvex optimization. Given one
optimization problem, we pair it with another by smoothly parametrizing the
domain. This is either for practical purposes (e.g., to use smooth optimization
algorithms with good guarantees) or for theoretical purposes (e.g., to reveal
that the landscape satisfies a strict saddle property). In both cases, the
central question is: how do the landscapes of the two problems relate? More
precisely: how do desirable points such as local minima and critical points in
one problem relate to those in the other problem? A key finding in this paper
is that these relations are often determined by the parametrization itself, and
are almost entirely independent of the cost function. Accordingly, we introduce
a general framework to study parametrizations by their effect on landscapes.
The framework enables us to obtain new guarantees for an array of problems,
some of which were previously treated on a case-by-case basis in the
literature. Applications include: optimizing low-rank matrices and tensors
through factorizations; solving semidefinite programs via the Burer-Monteiro
approach; training neural networks by optimizing their weights and biases; and
quotienting out symmetries.

Click here to read this post out
ID: 648347; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: Dec. 31, 2023, 7:33 a.m. Changes:
Dictionaries:
Words:
Spaces:
Views: 12
CC:
No creative common's license
Comments: