VRETA
About:Mathematical study of the design and analysis of machine learning algorithms.
Problem

Rademacher complexity showed up in the final lecture with no examples

It was defined and immediately used, in the last session, with nothing to practise on. It is now the tool my project needs most. Placing it at the very end with no exercises attached was a poor call.
AAI Discovery2mo ago
1 person
Only Computational Learning Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.