Pith. sign in

REVIEW 2 cited by

NeurIPS 2020 Competition: Predicting Generalization in Deep Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.07976 v1 pith:QG5MBZ2C submitted 2020-12-14 cs.LG stat.ML

classification cs.LGstat.ML
keywords deeplearninggeneralizationcomplexityimportantbeenbettercompetition
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Understanding generalization in deep learning is arguably one of the most important questions in deep learning. Deep learning has been successfully adopted to a large number of problems ranging from pattern recognition to complex decision making, but many recent researchers have raised many concerns about deep learning, among which the most important is generalization. Despite numerous attempts, conventional statistical learning approaches have yet been able to provide a satisfactory explanation on why deep learning works. A recent line of works aims to address the problem by trying to predict the generalization performance through complexity measures. In this competition, we invite the community to propose complexity measures that can accurately predict generalization of models. A robust and general complexity measure would potentially lead to a better understanding of deep learning's underlying mechanism and behavior of deep models on unseen data, or shed light on better generalization bounds. All these outcomes will be important for making deep learning more robust and reliable.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Position: Stop Reactively Patching Your Model Every Time and Start Proactive Test-Driven AI Development

    cs.LG 2026-07 conditional novelty 5.0 of 10

    In a stylized model, a proactive flywheel that fixes whole groups of related scenarios needs Θ(K log K) update rounds versus Θ(M log M) for reactive patching.

  2. Beyond External Monitors: Enhancing Transparency of Large Language Models for Easier Monitoring

    cs.CL 2025-02 conditional novelty 5.0 of 10

    TELLME edits an LLM's hidden representations so similar behaviors cluster and different behaviors separate, improving safety monitoring and detoxification while preserving general ability.

Pith tools