ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For the synthetic sparse-coding experiment specified by MAIS-O43, with nesting fraction γ\gamma, sparsity penalty λ\lambda, and dictionary size MM, determine the phase diagram of trained sparse autoencoders: for each parameter cell, do training runs recover the true dictionary, merge nested features, or converge to another solution such as a diffuse representation? In particular, determine whether trained sparse autoencoders can systematically converge to solutions distinct from global minimizers of the exact sparse-coding objective, despite achieving near-perfect reconstruction, and characterize the conditions under which each behavior occurs.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.