article

Learning factorial codes by predictability minimization

Author:

Jürgen SchmidhuberAuthors Info & Claims

Neural Computation, Volume 4, Issue 6

Pages 863 - 879

https://doi.org/10.1162/neco.1992.4.6.863

Published: 01 November 1992 Publication History

Abstract

No abstract available.

Cited By

View all

Hu MLiu ZLiu J(2024)mcVAE: disentangling by mean constraintThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-023-02843-940:2(1229-1243)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1007/s00371-023-02843-9
Vafaii HYates JButts DOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Hierarchical VAEs provide a normative account of motion processing in the primate brainProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3668124(46152-46190)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3668124
Fumero MWenzel FZancato LAchille ARodolà ESoatto SSchölkopf BLocatello FOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Leveraging sparse and shared feature activations for disentangled representation learningProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3667326(27682-27698)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3667326
Show More Cited By

Index Terms

Learning factorial codes by predictability minimization

Recommendations

Nonlinear complementarity as unconstrained and constrained minimization

The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtained from an augmented Lagrangian formulation. The dimensionality of the unconstrained problem is the same as that of the original problem, and the ...
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem

A popular approach to solving the nonlinear complementarity problem (NCP) is to reformulate it as the global minimization of a certain merit function over źn. A popular choice of the merit function is the squared norm of the Fischer-Burmeister function, ...
An Accelerated Inexact Proximal Point Algorithm for Convex Minimization

The proximal point algorithm is classical and popular in the community of optimization. In practice, inexact proximal point algorithms which solve the involved proximal subproblems approximately subject to certain inexact criteria are truly ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Neural Computation Volume 4, Issue 6

Nov. 1992

177 pages

ISSN:0899-7667

Editor:
Terrence Sejnowski
Univ. of California at San Diego

Issue’s Table of Contents

Publisher

MIT Press

Cambridge, MA, United States

Publication History

Published: 01 November 1992

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

58
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hu MLiu ZLiu J(2024)mcVAE: disentangling by mean constraintThe Visual Computer: International Journal of Computer Graphics10.1007/s00371-023-02843-940:2(1229-1243)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1007/s00371-023-02843-9
Vafaii HYates JButts DOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Hierarchical VAEs provide a normative account of motion processing in the primate brainProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3668124(46152-46190)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3668124
Fumero MWenzel FZancato LAchille ARodolà ESoatto SSchölkopf BLocatello FOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Leveraging sparse and shared feature activations for disentangled representation learningProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3667326(27682-27698)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3667326
Mezza AZanoni MSarti A(2023)A latent rhythm complexity model for attribute-controlled drum pattern generationEURASIP Journal on Audio, Speech, and Music Processing10.1186/s13636-022-00267-22023:1Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1186/s13636-022-00267-2
Gomez DQuijano NGiraldo L(2023)Information Optimization and Transferable State Abstractions in Deep Reinforcement LearningIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2022.320072645:4(4782-4793)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1109/TPAMI.2022.3200726
Wang SLi CLi YYuan YWang G(2023)Self-Supervised Information Bottleneck for Deep Multi-View Subspace ClusteringIEEE Transactions on Image Processing10.1109/TIP.2023.324680232(1555-1567)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1109/TIP.2023.3246802
Cao JNai RYang QHuang JGao YKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)An empirical study on disentanglement of negative-free contrastive learningProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3600359(1210-1222)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3600359
He ZZhang LYang YGao X(2022)Partial Alignment for Object Detection in the WildIEEE Transactions on Circuits and Systems for Video Technology10.1109/TCSVT.2021.313885132:8(5238-5251)Online publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1109/TCSVT.2021.3138851
Jiantao Wang LYang BLi FLiu CZhou J(2022)DEFT: distilling entangled factors by preventing information diffusionMachine Language10.1007/s10994-022-06134-7111:6(2275-2295)Online publication date: 1-Jun-2022
https://dl.acm.org/doi/10.1007/s10994-022-06134-7
Hu MLiu J(2022)β-CapsNet: learning disentangled representation for CapsNet by information bottleneckNeural Computing and Applications10.1007/s00521-022-07729-w35:3(2503-2525)Online publication date: 30-Aug-2022
https://dl.acm.org/doi/10.1007/s00521-022-07729-w
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Nonlinear complementarity as unconstrained and constrained minimization

An unconstrained smooth minimization reformulation of the second-order cone complementarity problem

An Accelerated Inexact Proximal Point Algorithm for Convex Minimization

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations