paper-with-me

Papers

Rethinking Parameter Counting in Deep Models: Effective Dimensionality Revisited

2020-03-04 · Wesley J. Maddox, Gregory Benton, Andrew Gordon Wilson

Neural networks appear to have mysterious generalization properties when using parameter counting as a proxy for complexity. Indeed, neural networks often have many more parameters than there are data points, yet still provide good generalization performance. Moreover, when we measure generalization as a function of parameters, we see double descent behaviour, where the test error decreases, increases, and then again decreases. We show that many of these properties become understandable when viewed through the lens of effective dimensionality, which measures the dimensionality of the parameter space determined by the data. We relate effective dimensionality to posterior contraction in Bayesian deep learning, model selection, width-depth tradeoffs, double descent, and functional diversity in loss surfaces, leading to a richer understanding of the interplay between parameters and functions in deep models. We also show that effective dimensionality compares favourably to alternative norm- and flatness- based generalization measures.

📄 PDF Abstract BibTeX arXiv:2003.02139

Code (1)

g-benton/hessian-eff-dim 공식 구현 pytorch

Tasks

DiversityModel Selection

Similar Papers 제목 키워드 기반

Rethinking Parameter Counting: Effective Dimensionality Revisited

2021-01-01 · Gregory Benton, Wesley Maddox, Andrew Gordon Wilson

Neural networks appear to have mysterious generalization properties when using parameter counting as a proxy for complexity. Indeed, neural networks often have many more parameters than there are data points, yet still p…

DiversityModel Selection

Answer Set Solving with Bounded Treewidth Revisited

2017-02-09 · Johannes Fichte, Markus Hecher, Michael Morak, Stefan Woltran

Parameterized algorithms are a way to solve hard problems more efficiently, given that a specific parameter of the input is small. In this paper, we apply this idea to the field of answer set programming (ASP). To this e…

On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters

2023-09-29 · Matthias Lanzinger, Pablo Barceló

Seminal research in the field of graph neural networks (GNNs) has revealed a direct correspondence between the expressive capabilities of GNNs and the $k$-dimensional Weisfeiler-Leman ($k$WL) test, a widely-recognized me…

Subgraph Counting

Approximate Counting of Graphical Models Via MCMC Revisited

2013-01-30 · Jose M. Peña

In Pe\~na (2007), MCMC sampling is applied to approximately calculate the ratio of essential graphs (EGs) to directed acyclic graphs (DAGs) for up to 20 nodes. In the present paper, we extend that work from 20 to 31 node…

Formation-Controlled Dimensionality Reduction

2024-04-10 · Taeuk Jeong, Yoon Mo Jung, Euntack Lee

Dimensionality reduction represents the process of generating a low dimensional representation of high dimensional data. Motivated by the formation control of mobile agents, we propose a nonlinear dynamical system for di…

Dimensionality Reduction