Pith. sign in

REVIEW 2 major objections 4 minor 300 references

Riemannian Deep Learning: Modules, Networks, and Geometries

T0 review · 2 major / 4 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This thesis argues that normalization and classification can be built once on Lie groups and gyrogroups and then instantiated across the manifolds used in practice.

desk verdict A serious, well-documented thesis that synthesizes nine peer-reviewed papers; the genuinely new value is the unified normalization/classification framework and the pseudo-reductive gyrogroup analysis, with a real but narrow caveat about the 'all known gyrogroups' claim. read the letter →

arxiv 2607.19305 v2 pith:VRN2AWJF submitted 2026-07-21 cs.LG cs.AImath.DG

Chen Ziheng This is my paper · ORCID
classification cs.LGcs.AImath.DG
keywords RiemanniandeeplearningLiegroupsgyrogroupsbatchnormalizationmultinomiallogisticregressionSPDmanifoldshyperbolicembeddingscorrelationmatrices
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This doctoral thesis seeks to unify Riemannian deep learning by lifting two core neural modules—batch normalization and multinomial logistic regression—from Euclidean space and from individual manifolds to broad algebraic classes of manifolds. It proposes LieBN for Lie groups with invariant metrics and GyroBN for pseudo-reductive gyrogroups, and proves that both control the Riemannian sample mean and variance. It then extends MLR to general Riemannian manifolds via Riemannian trigonometry, requiring only an explicit logarithmic map. The thesis also builds networks for hyperbolic, correlation, and SPD representations and introduces learnable and fast SPD metrics. If these claims hold, practitioners can reuse one normalization and one classification layer across the SPD, rotation, Grassmannian, hyperbolic, spherical, and correlation manifolds.

What carries the argument

The load-bearing object is the pseudo-reductive gyrogroup: an algebraic structure satisfying the first three gyrogroup axioms plus pseudo-reduction (gyr[a,x]=id for a a left inverse of x). This axiom restores the left cancellation law ⊖x⊕(x⊕y)=y, which makes left gyrotranslation a gyroisometry; that isometry is what lets GyroBN center a batch and provably move its mean while controlling the variance. The companion machinery for classification is Riemannian trigonometry: RMLR computes logits as Riemannian distances to geodesic hyperplanes, reducing classification to evaluating a logarithmic map and an inner product. Together the two mechanisms turn group-like structure and a logarithmic map i

What would settle it

Compute gyr[a,x]z and the left-cancellation residual ∥⊖x⊕(x⊕y)⊖y∥ on the Grassmannian's ONB representation for a=⊖x; a single pair with nonzero residual at machine precision would break the proof that left gyrotranslation is a gyroisometry, and with it GyroBN's mean-control theorem for that geometry.

Watch

Extended reading notes

Core claim

The central claim is that the algebraic structures already present on common manifolds are enough to make deep-learning modules universal. Algorithm 1 (LieBN) uses group translations for centering and biasing and tangent-space scaling at the identity, and the thesis proves that under any invariant metric this controls the Riemannian mean and variance (Props. 61–62, 65). GyroBN extends the same principle to pseudo-reductive gyrogroups—groupoids in which gyrations of left inverses are trivial—and recovers LieBN as a special case. For classification, Riemannian Multinomial Logistic Regression (RMLR) replaces the point-to-hyperplane infimum with a Riemannian-trigonometric formula, so a manifold

Load-bearing premise

The normalization guarantee rests on the assumption that every manifold in the framework's coverage is pseudo-reductive and that its gyrations are gyroisometries; if any admitted gyrogroup violates this, the provable mean-and-variance control for that manifold fails.

Editorial extensions

If this is right

  • Networks on SO(n), SPD, full-rank correlation, Grassmannian, and constant-curvature manifolds can all use the same LieBN/GyroBN layer with provable mean and variance control instead of manifold-specific recipes.
  • Any manifold with an explicit geodesic distance and logarithmic map gets an intrinsic classifier; RMLR subsumes existing LogEig and hyperbolic classifiers as special cases.
  • Correlation matrices become a first-class representation: CorNets provide MLR, FC, and convolutional layers directly on Cor+(n) with accurate gradients.
  • SPD geometry can be adapted to data via parameterized matrix logarithms, and Cholesky-product metrics give fast, closed-form, numerically stable operators for SPD networks.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the pseudo-reductivity criterion is as general as the thesis asserts, the same normalization module should transfer to future gyrogroup-based architectures, including attention or transformer layers defined on gyrovector spaces; a clean test is to instantiate GyroBN inside a gyro-attention block and compare convergence.
  • The algebraic checklist (pseudo-reductivity plus gyroisometric gyrations) gives future work a quick necessary condition: any newly proposed manifold gyro-structure must be checked for these two properties before mean-variance normalization can be claimed.
  • RMLR's reliance only on a logarithmic map suggests a practical recipe for manifolds without closed-form geodesic distances: approximate the logarithmic map and plug it into the same classifier, which would extend intrinsic classification beyond the manifolds listed.
  • The learnable SPD metrics blur the line between architecture search and geometry search; one could optimize the metric parameters jointly with network weights to interpolate among known SPD geometries inside a single model.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The thesis develops a unified framework for Riemannian deep learning, with three strands: reusable modules (batch normalization and multinomial logistic regression), manifold-specific network architectures (Proper Velocity hyperbolic networks, Busemann-based hyperbolic layers, full-rank correlation networks), and learnable/fast SPD geometries (ALEM and product Cholesky metrics). The central theoretical claims are that LieBN controls Riemannian sample mean and variance on Lie groups with invariant metrics (Props. 61–62, 65), that GyroBN extends this control to pseudo-reductive gyrogroups with gyroisometric gyrations (Thms. 75, 77–99), and that RMLR subsumes existing Euclidean/SPD/Lie classifiers as special cases (Sec. 4.3, Tab. 4.1). These claims are supported by proofs in Appendix B and by experiments across vision, signal processing, graph learning, and genomics. The thesis also introduces several new geometric constructions—CRIM, PV coordinates, ALEM, PCM/BWCM—and releases PyTorch toolboxes for LieBN and GyroBN.

Significance. If the results hold, the thesis delivers a genuinely general algebraic foundation for normalization: a single construction (GyroBN) covers Lie groups, the Grassmannian, constant-curvature spaces, and full-rank correlation manifolds, with provable control of first- and second-order sample statistics rather than heuristic normalization. The RMLR framework similarly unifies a dispersed set of manifold classifiers under one logarithmic-map formulation. The thesis is also strong on the practical side: closed-form operators for several geometries, explicit numerical stability and efficiency comparisons (Tabs. 6.13, 6.16, 6.17), and reproducible public code for the two normalization toolboxes. The main risk is the breadth claim attached to pseudo-reductivity: the central theorem is conditional on an algebraic property, and the universal statement about 'all known gyrogroups' is not proven as a classification theorem. However, the listed instantiations each come with proofs in Appendix B, so the conditional theorem itself is defensible. This is a scope caveat rather than a demonstrated flaw.

major comments (2)
  1. [Sec. 3.3.1, Def. 73] The text asserts that the GyroBN conditions (pseudo-reductivity and gyroisometric gyrations) 'are satisfied by all known gyrogroups in machine learning,' but the support is a per-manifold list (Prop. 74 for the Grassmannian; seven instantiations in Sec. 3.3.4 with proofs in App. B), not a general theorem. If any of the newly derived closed-form gyro-structures (Lorentz, projected hypersphere, row-wise correlation) failed pseudo-reductivity, the guaranteed mean/variance control would not follow for that manifold. I recommend weakening the universal claim to 'all gyrogroups considered in this thesis' or adding a summary table that explicitly verifies pseudo-reductivity and gyroisometry for each instantiation. This is a correctness-risk concern about scope, not a counterexample to the conditional theorem.
  2. [Secs. 2.9.5 and 3.3.4] The K-stereographic gyration formula is stated to be valid only when D_st > 0 (Eq. 2.147), and positive-curvature logarithm/parallel-transport maps are restricted away from antipodal configurations. Since GyroBN on the sphere and projected hypersphere relies on gyroisometries at arbitrary batch points, the manuscript should clarify whether the normalization guarantee extends to points where D_st = 0 or to antipodal pairs, and if not, state the domain restriction in the GyroBN theorem. Similarly, the radius-model formulas exclude singular configurations; a short paragraph on domain validity would make the coverage claim precise.
minor comments (4)
  1. [Tab. 3.11 (and Tab. 6.8)] NTU60 results are reported as single accuracy values, whereas other tables report mean±std (e.g., Tab. 3.9). Please report mean±std over multiple runs, or state the protocol used for these entries, so the reader can assess variance.
  2. [Sec. 3.2.1] The claim that CRIM is 'the first non-trivial right-invariant SPD metric' is strong. Please provide a brief literature pointer or a sentence substantiating that no other non-commutative right-invariant SPD metric appears in the prior work.
  3. [Sec. 3.2.5.1, Tab. 3.6] The notation ⊕_LieAI and ⊙ for the power-deformed operations is introduced only in the table; a one-sentence definition of how P^θ pulls back the group operation would improve readability for a reader who has not followed the deformation discussion.
  4. [Sec. 1.3] The list of excluded papers is helpful for provenance, but the phrasing 'Since Chapter X follows ...' in the final paragraph could be misread as saying the excluded papers are prerequisites. Consider moving that explanatory paragraph to an appendix or editorial preface.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the conditional algebraic theorems are self-contained.

full rationale

I find no load-bearing circularity. The central claims are conditional on explicitly stated algebraic hypotheses—invariant metrics for LieBN and pseudo-reductive gyrogroups with gyroisometric gyrations for GyroBN—and the proofs are carried out from the definitions in the appendix, not obtained by fitting parameters or by invoking the author's own prior papers as the proof. The statements that GyroBN recovers LieBN (Tab. 3.13) and that RMLR subsumes LogEig/Lie classifiers (Tab. 4.1) are mathematical containments visible in the equations; they are specializations, not predictions forced by fitted inputs. The only caveat worth flagging is the breadth claim in Sec. 3.3.1 that 'These conditions are satisfied by all known gyrogroups in machine learning,' which is supported case-by-case (Prop. 74, Sec. 3.3.4, App. B) rather than by a general classification theorem. That is a scope/correctness risk for the universality claim, not a circularity in the conditional GyroBN theorem. The self-citations to the author's own publications are compilation artifacts of a thesis and are not load-bearing: none of the derivations reduces to an unverified self-citation chain.

Assumptions & free parameters 4 free parameters · 6 assumptions · 4 invented entities

The central claims rest on standard Riemannian geometry (O'Neill, Bridson-Haefliger, Absil-Boumal), on the intrinsic Gaussian population model (Eq. 3.7), on per-manifold verification that the relevant gyro-structures are pseudo-reductive, and on standard matrix-calculus identities (Daleckii-Krein, Cholesky differentials). The principal non-standard premise is the assertion that all known machine-learning gyrogroups satisfy the pseudo-reductive law (Sec. 3.3.1), verified case by case rather than proven in general. Free parameters are dominated by the per-dataset deformation exponent θ, which the headline 'Best θ' numbers depend on.

free parameters (4)
  • θ (metric deformation exponent) = per-dataset values such as 1.5, 0.5, -0.5
    Deformation exponent for (θ,α,β)-AIM, θ-LCM, θ-CRIM, θ-PCM, θ-BWCM; tuned per data set from candidate grids and reported as 'Best θ' in Tables 3.9-3.10 and A.15. The headline accuracies depend on this selection.
  • (α, β) metric-family parameters = (1, 0)
    The thesis states '(α,β) = (1,0)' is simply set and only θ is tuned; these are fixed degrees of freedom of the metric family rather than derived values.
  • PHCM hemisphere weights α_i = 1 (canonical)
    PHCM is instantiated with all weights equal to 1 (Sec. 2.9.2); other weightings are part of the design space but unexplored.
  • Curvature K of constant-curvature models = -1 or +1
    Standard fixed curvature values for hyperbolic/spherical models; assumed rather than fitted in GyroBN and PV experiments.
assumptions (6)
  • domain assumption Intrinsic Gaussian density on Lie groups (Eq. 3.7) with MLE equal to the sample Fréchet mean.
    Prop. 61 anchors LieBN's mean control; the MLE identification is inherited from prior studies (Rem. 63 cites [176, 35, 34]) and is not re-derived in full generality in the thesis.
  • domain assumption Every machine-learning gyrogroup is pseudo-reductive with gyroisometric gyrations.
    Sec. 3.3.1 asserts this for 'all known gyrogroups'; the document proves per-manifold (Prop. 74 for Grassmannian) and corrects the prior Nguyen-Yang isometry proof, so the general claim is asserted, not proven from axioms.
  • standard math Weighted Fréchet means exist and are unique on the relevant geodesic balls.
    Used for running-statistic updates (Alg. 1) and WFM computations; cited to [2, Thm. 2.1].
  • standard math Busemann functions and horospheres behave as in Hadamard spaces.
    Sec. 5.3 builds BMLR/BFC on Busemann functions of the Poincaré and Lorentz models, relying on Bridson-Haefliger Ch. II.8 facts.
  • standard math Daleckii-Krein formula and Cholesky differential identities hold as stated.
    All SPD backpropagation (Sec. 2.8) and the CRIM operators (Thm. 69) use these identities.
  • standard math Constant-curvature spaces are classified by dimension and curvature (O'Neill Cor. 8.25).
    Sec. 2.9.5 invokes this classification to justify the model zoo (Poincaré, Lorentz, Beltrami-Klein, sphere, projected hypersphere) used in GyroBN and PV experiments.
invented entities (4)
  • Pseudo-reductive gyrogroup independent evidence
    purpose: Algebraic foundation for GyroBN; relaxes left-reduction (G4) so left cancellation and gyroisometry of gyrotranslation hold without full gyrogroup axioms.
    Falsifiable through normalization experiments on the Grassmannian, five CCSs, and correlation manifolds (Secs. 3.3.4-3.3.5), and through the corrected proof of Grassmannian translation isometry.
  • CRIM (Cholesky Right-Invariant Metric) independent evidence
    purpose: First claimed non-trivial right-invariant SPD metric; enables right-translation LieBN on SPD manifolds.
    Closed-form geodesic/exponential/log operators stated in Thm. 69 and geodesic completeness in Cor. 70; evaluated on Radar, HDM05, FPHA (Tab. 3.9).
  • Proper Velocity (PV) coordinate model of hyperbolic space independent evidence
    purpose: Unconstrained hyperbolic representation that avoids FP32 failures of Möbius/Lorentz scalar multiplication.
    Falsifiable via failure-rate and round-trip error measurements (Tabs. 5.1-5.2) and via accuracy on image, graph, and TEB tasks.
  • ALEM (Adaptive Log-Euclidean Metric) independent evidence
    purpose: Learnable SPD geometry via parameterized matrix logarithms, adapting the metric during network training.
    Learned basis parameters are visualized (Fig. 6.2) and accuracy/efficiency measured on HDM05, FPHA, AFEW (Tabs. 6.2-6.4).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Riemannian Deep Learning: Modules, Networks, and Geometries." pith.science (2026). https://pith.science/paper/VRN2AWJF

@misc{pith2026260719305,
  author       = {Pith},
  title        = {Pith review of: Riemannian Deep Learning: Modules, Networks, and Geometries},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VRN2AWJF}},
  note         = {Machine review of arXiv:2607.19305}
}
read the original abstract

Deep neural networks on manifold-valued representations have attracted growing interest, but many basic components remain tied to specific manifolds, rely on Euclidean approximations, or require costly and numerically fragile geometric operations. This thesis develops a unified framework for Riemannian deep learning from three complementary perspectives: reusable neural modules, manifold-specific network architectures, and the design of underlying geometries. It generalizes batch normalization from Euclidean spaces and individual manifolds to broad classes of Lie groups and gyrogroups, and extends multinomial logistic regression from Euclidean space to SPD manifolds and then to general Riemannian manifolds. It further develops neural networks for several important geometric representations, including an unconstrained model of hyperbolic space, Busemann-based hyperbolic learning, and full-rank correlation matrices. Finally, it introduces adaptive and computationally efficient Riemannian metrics on SPD manifolds, including learnable Log-Euclidean geometries and fast, stable Cholesky-based geometries. The proposed methods are supported by theoretical analysis and validated through numerical experiments and applications in vision, signal processing, graph learning, and genomics.

Figures

Figures reproduced from arXiv: 2607.19305 by the authors.

Figure 2.1
Figure 2.1. The black stars denote 2 × 2 correlation matrices, while the red, green, and blue dots denote corresponding SPD matrices. The black dots denote the boundary of the SPD cone. size pairwise dependencies rather than raw variances. Only recently have Riemannian structures been developed for correlation matrices. The space of n×n full-rank correlation matrices, denoted by Cor+ (n), forms a Rieman￾nian manifold and can be… view at source ↗
Figure 3.1
Figure 3.1. Illustration of LieBN on the SPD, rotation, and correlation Lie groups. The [PITH_FULL_IMAGE:figures/full_fig_p086_3_1.png] view at source ↗
Figure 3.2
Figure 3.2. Minimal examples of applying LieBN. • Validation of the effectiveness of our LieBN framework by extensive experiments on different geometries.2 Outline. Sec. 3.2.2 recalls the invariant metrics and Lie structures used by LieBN. Sec. 3.2.3 revisits Euclidean BN and RBN. Sec. 3.2.4 develops LieBN on Lie groups under left- and right-invariant metrics and establishes its statistical control. Sec. 3.2.5 instantiates LieB… view at source ↗
Figures from the paper (23 more)
Figure 3.3
Figure 3.3. Figure 3.3: Visualization of input and output 30 × 30 SPD matrices in LieBN using 2 × 2 Riemannian t-SNE embeddings. The first row shows the input and output under different metrics. Due to the significant difference in magnitude between the t-SNE embeddings of LieBN’s input and…
Figure 3.4
Figure 3.4. Figure 3.4: Test accuracy curves corresponding to Tab. [PITH_FULL_IMAGE:figures/full_fig_p105_3_4.png]
Figure 3.5
Figure 3.5. Figure 3.5: Illustration of GyroBN on manifold-valued data. Blue points, green points, [PITH_FULL_IMAGE:figures/full_fig_p107_3_5.png]
Figure 3.6
Figure 3.6. Figure 3.6: Minimal examples of applying GyroBN. 3.3.2 Pseudo-Reductive Gyrogroups Given a gyrogroup (G, ⊕), the left gyrotranslation by x ∈ G is defined as Lx : G → G, Lx(y) = x ⊕ y, ∀y ∈ G. (3.32) If any gyrotranslation is a gyroisometry, we can use gyrotranslation to center m…
Figure 3.7
Figure 3.7. Figure 3.7: A conceptual comparison of the derivation logic in our work with that in [PITH_FULL_IMAGE:figures/full_fig_p110_3_7.png]
Figure 3.8
Figure 3.8. Figure 3.8: Visualization of GyroBN across different geometries. Blue and green points [PITH_FULL_IMAGE:figures/full_fig_p131_3_8.png]
Figure 3.9
Figure 3.9. Figure 3.9: Training and testing curves of 1-block GyroGr on two NTU data sets. [PITH_FULL_IMAGE:figures/full_fig_p134_3_9.png]
Figure 4.1
Figure 4.1. Figure 4.1: Conceptual illustration of SPD hyperplanes induced by [PITH_FULL_IMAGE:figures/full_fig_p147_4_1.png]
Figure 4.2
Figure 4.2. Figure 4.2: Illustration of the deformation (left) and Venn diagram (right) of metrics on SPD manifolds, where IEM, SREM, and 1 4 PAM denote Inverse Euclidean Metric, Square Root Euclidean Metric, and Polar Affine Metric scaled by 1/4, respectively. 4.3.3 SPD Multinomial Logisti…
Figure 4.3
Figure 4.3. Figure 4.3: Conceptual illustration of SPD hyperplanes induced by five families of [PITH_FULL_IMAGE:figures/full_fig_p154_4_3.png]
Figure 4.4
Figure 4.4. Figure 4.4: Conceptual illustration of a Lie hyperplane. Each pair of antipodal black [PITH_FULL_IMAGE:figures/full_fig_p157_4_4.png]
Figure 5.1
Figure 5.1. Figure 5.1: Illustration: red curves are different horospheres of [PITH_FULL_IMAGE:figures/full_fig_p182_5_1.png]
Figure 5.2
Figure 5.2. Figure 5.2: Validation accuracy curves on ImageNet-1k. [PITH_FULL_IMAGE:figures/full_fig_p189_5_2.png]
Figure 5.3
Figure 5.3. Figure 5.3: Illustration of the Log-Euclidean 1D convolution with two kernels. The [PITH_FULL_IMAGE:figures/full_fig_p198_5_3.png]
Figure 5.4
Figure 5.4. Figure 5.4: Illustration of the PHCM convolution and MLR. The multi-channel input [PITH_FULL_IMAGE:figures/full_fig_p200_5_4.png]
Figure 5.5
Figure 5.5. Figure 5.5: Illustration of the decision hyperplanes in the correlation MLRs under five [PITH_FULL_IMAGE:figures/full_fig_p204_5_5.png]
Figure 5.6
Figure 5.6. Figure 5.6: Distribution of per-sample coefficients of variation of diagonal variances on [PITH_FULL_IMAGE:figures/full_fig_p206_5_6.png]
Figure 5.7
Figure 5.7. Figure 5.7: Distribution of per-sample coefficients of variation of diagonal variances [PITH_FULL_IMAGE:figures/full_fig_p207_5_7.png]
Figure 5.8
Figure 5.8. Figure 5.8: Distribution of ratios of diagonal to off-diagonal entries on FPHA. [PITH_FULL_IMAGE:figures/full_fig_p208_5_8.png]
Figure 5.9
Figure 5.9. Figure 5.9: Distribution of ratios of diagonal to off-diagonal entries on HDM05. [PITH_FULL_IMAGE:figures/full_fig_p208_5_9.png]
Figure 6.1
Figure 6.1. Figure 6.1: Accuracy curves on the FPHA data set. SPDNet SPDNetBN ALog MUL DIV RELU 85.73±0.80 86.83±0.74 87.8±0.71 88.07±1.13 86.65±0.68 [PITH_FULL_IMAGE:figures/full_fig_p229_6_1.png]
Figure 6.2
Figure 6.2. Figure 6.2: Visualization of parameters in the ALog layer on the HDM05 and FPHA [PITH_FULL_IMAGE:figures/full_fig_p231_6_2.png]
Figure 6.3
Figure 6.3. Figure 6.3: Geodesic interpolation of SPD matrices under different Riemannian metrics. [PITH_FULL_IMAGE:figures/full_fig_p247_6_3.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 19 linked inside Pith

  1. [1]

    ICCV , year =

    Is second-order information helpful for large-scale visual recognition? , author =. ICCV , year =

  2. [2]

    CVPR , year =

    Towards faster training of global covariance pooling networks by iterative matrix square root normalization , author =. CVPR , year =

  3. [3]

    ICCV , year =

    Matrix backpropagation for deep networks with structured layers , author =. ICCV , year =

  4. [4]

    arXiv preprint arXiv:1509.07838 , year=

    Training deep networks with structured layers by matrix backpropagation , author=. arXiv preprint arXiv:1509.07838 , year=

    arXiv

  5. [5]

    2008 , publisher=

    Functions of matrices: theory and computation , author=. 2008 , publisher=

    2008

  6. [6]

    2007 , publisher=

    Positive Definite Matrices , author=. 2007 , publisher=

    2007

  7. [7]

    2013 , series=

    Matrix analysis , author=. 2013 , series=

    2013

  8. [8]

    BMVC , year=

    Improved bilinear pooling with cnns , author=. BMVC , year=

Show all 300 references
  1. [9]

    NeurIPS , year =

    Backpropagation-friendly eigendecomposition , author =. NeurIPS , year =

  2. [10]

    Essentials of Pad

    George Jr, A and others , year=. Essentials of Pad

  3. [11]

    The theory and application of the Pad

    Baker Jr, George A , year=. The theory and application of the Pad

  4. [12]

    Baker, George Allen and Gammel, John L , year=. The Pad

  5. [13]

    Van Assche, Walter , journal=. Pad

  6. [14]

    General theorems on the convergence of sequences of Pad

    Wall, HS , journal=. General theorems on the convergence of sequences of Pad

  7. [15]

    An Overview , author=

    On Rational Function Techniques and Pade Approximants. An Overview , author=. 2002 , publisher=

    2002

  8. [16]

    ICCV , year =

    Bilinear cnn models for fine-grained visual recognition , author =. ICCV , year =

  9. [17]

    CVPR , year =

    Imagenet: A large-scale hierarchical image database , author =. CVPR , year =

  10. [18]

    CVPR , year =

    G2DeNet: Global Gaussian distribution embedding network and its application to visual recognition , author =. CVPR , year =

  11. [19]

    CVPR , year =

    Deep global generalized Gaussian networks , author =. CVPR , year =

  12. [20]

    IEEE TPAMI , year =

    Robust Differentiable SVD , author =. IEEE TPAMI , year =

  13. [21]

    Dang and K

    Z. Dang and K. M. Yi and Y. Hu and F. Wang and P. Fua and M. Salzmann , booktitle =

  14. [22]

    Dang and K.M

    Z. Dang and K.M. Yi and F. Wang and Y. Hu and P. Fua and M. Salzmann , journal =

  15. [23]

    IEEE TPAMI , year =

    Deep cnns meet global covariance pooling: Better representation and generalization , author =. IEEE TPAMI , year =

  16. [24]

    CVPR , year =

    An investigation into the stochasticity of batch whitening , author =. CVPR , year =

  17. [25]

    ICCV , year =

    Understanding generalized whitening and coloring transform for universal style transfer , author =. ICCV , year =

  18. [26]

    CVPR , year =

    Image-to-image translation via group-wise deep whitening-and-coloring transformation , author =. CVPR , year =

  19. [27]

    ECCV , year =

    Semantic segmentation with second-order pooling , author =. ECCV , year =

  20. [28]

    CVPR , year =

    Decorrelated batch normalization , author =. CVPR , year =

  21. [29]

    1981 , publisher=

    Approximation theory and methods , author=. 1981 , publisher=

    1981

  22. [30]

    CVPR , year =

    Deep residual learning for image recognition , author =. CVPR , year =

  23. [31]

    Welinder and S

    P. Welinder and S. Branson and T. Mita and C. Wah and F. Schroff and S. Belongie and P. Perona , Institution =

  24. [32]

    arXiv preprint arXiv:1306.5151 , year=

    Fine-grained visual classification of aircraft , author=. arXiv preprint arXiv:1306.5151 , year=

    arXiv

  25. [33]

    2013 , address =

    3D Object Representations for Fine-Grained Categorization , booktitle =. 2013 , address =

    2013

  26. [34]

    arXiv preprint arXiv:1409.1556 , year=

    Very deep convolutional networks for large-scale image recognition , author=. arXiv preprint arXiv:1409.1556 , year=

    arXiv

  27. [35]

    Novel Dataset for Fine-Grained Image Categorization

    Aditya Khosla and Nityananda Jayadevaprakash and Bangpeng Yao and Li Fei-Fei. Novel Dataset for Fine-Grained Image Categorization. First Workshop on Fine-Grained Visual Categorization, IEEE Conference on Computer Vision and Pattern Recognition. 2011

    2011

  28. [36]

    2003 , publisher=

    Introductory lectures on convex optimization: A basic course , author=. 2003 , publisher=

    2003

  29. [37]

    ICCV , year =

    Dynamic label graph matching for unsupervised video re-identification , author =. ICCV , year =

  30. [38]

    CVPR , year =

    Compact bilinear pooling , author =. CVPR , year =

  31. [39]

    CVPR , year =

    Low-Rank Bilinear Pooling for Fine-Grained Classification , author =. CVPR , year =

  32. [40]

    CVPR , year =

    Monet: Moments embedding network , author =. CVPR , year =

  33. [41]

    CVPR , year =

    Kernel Pooling for Convolutional Neural Networks , author =. CVPR , year =

  34. [42]

    ECCV , year =

    Hierarchical Bilinear Pooling for Fine-Grained Visual Recognition , author =. ECCV , year =

  35. [43]

    ECCV , year =

    Grassmann Pooling as Compact Homogeneous Bilinear Pooling for Fine-Grained Visual Classification , author =. ECCV , year =

  36. [44]

    NeurIPS , year =

    Learning deep bilinear transformation for fine-grained image representation , author =. NeurIPS , year =

  37. [45]

    ECCV , year =

    Toward Faster and Simpler Matrix Normalization via Rank-1 Update , author =. ECCV , year =

  38. [46]

    arXiv preprint arXiv:1211.7102 , year=

    SVD based image processing applications: state of the art, contributions and research challenges , author=. arXiv preprint arXiv:1211.7102 , year=

    arXiv

  39. [47]

    2007 , publisher=

    Understanding complex datasets: data mining with matrix decompositions , author=. 2007 , publisher=

    2007

  40. [48]

    arXiv preprint arXiv:1312.6034 , year=

    Deep inside convolutional networks: Visualising image classification models and saliency maps , author=. arXiv preprint arXiv:1312.6034 , year=

    arXiv

  41. [49]

    ECCV , year =

    Visualizing and understanding convolutional networks , author =. ECCV , year =

  42. [50]

    ICCV , year =

    Interpretable explanations of black boxes by meaningful perturbation , author =. ICCV , year =

  43. [51]

    ICCV , year =

    Understanding deep networks via extremal perturbations and smooth masks , author =. ICCV , year =

  44. [52]

    CVPR , year =

    There and back again: Revisiting backpropagation saliency methods , author =. CVPR , year =

  45. [53]

    arXiv preprint arXiv:1412.6806 , year=

    Striving for simplicity: The all convolutional net , author=. arXiv preprint arXiv:1412.6806 , year=

    arXiv

  46. [54]

    ICCV , year =

    Grad-cam: Visual explanations from deep networks via gradient-based localization , author =. ICCV , year =

  47. [55]

    BMVC , year=

    Rise: Randomized input sampling for explanation of black-box models , author=. BMVC , year=

  48. [56]

    NeurIPS , year =

    Real time image saliency for black box classifiers , author =. NeurIPS , year =

  49. [57]

    CVIU , volume=

    Classifier-agnostic saliency map extraction , author=. CVIU , volume=. 2020 , publisher=

    2020

  50. [58]

    CVPR , year =

    Densely connected convolutional networks , author =. CVPR , year =

  51. [59]

    CVPR , year =

    Rethinking the inception architecture for computer vision , author =. CVPR , year =

  52. [60]

    Psychometrika , volume=

    The approximation of one matrix by another of lower rank , author=. Psychometrika , volume=. 1936 , publisher=

    1936

  53. [61]

    Delving Deeper into the Whorl of Flower Segmentation

    Maria-Elena Nilsback and Andrew Zisserman. Delving Deeper into the Whorl of Flower Segmentation. Image and Vision Computing. 2009

    2009

  54. [62]

    Mathematische Nachrichten , volume=

    A note on von Neumann's trace inequalitv , author=. Mathematische Nachrichten , volume=. 1991 , publisher=

    1991

  55. [63]

    Monatshefte f

    A trace inequality of John von Neumann , author=. Monatshefte f. 1975 , publisher=

    1975

  56. [64]

    ICCV , year =

    Why Approximate Matrix Square Root Outperforms Accurate SVD in Global Covariance Pooling? , author =. ICCV , year =

  57. [65]

    2015 , URL =

    Inceptionism: Going Deeper into Neural Networks , author =. 2015 , URL =

    2015

  58. [66]

    The Annals of Applied Statistics , volume=

    Non-Euclidean statistics for covariance matrices, with applications to diffusion tensor imaging , author=. The Annals of Applied Statistics , volume=. 2009 , publisher=

    2009

  59. [67]

    SIAM journal on matrix analysis and applications , volume=

    Geometric means in a novel vector space structure on symmetric positive-definite matrices , author=. SIAM journal on matrix analysis and applications , volume=. 2007 , publisher=

    2007

  60. [68]

    IJCV , year =

    A Riemannian framework for tensor computing , author =. IJCV , year =

  61. [69]

    Afsari, Bijan , booktitle=

  62. [70]

    NeurIPS , year =

    A new metric on the manifold of kernel matrices with application to matrix geometric means , author =. NeurIPS , year =

  63. [71]

    arXiv preprint arXiv:1708.02862 , year=

    Webvision database: Visual learning and understanding from web data , author=. arXiv preprint arXiv:1708.02862 , year=

    arXiv

  64. [72]

    arXiv preprint arXiv:2006.07159 , year=

    Are we done with ImageNet? , author=. arXiv preprint arXiv:2006.07159 , year=

    2006 arXiv

  65. [73]

    Communications of the ACM , volume=

    Solution of the matrix equation AX+ XB= C [F4] , author=. Communications of the ACM , volume=. 1972 , publisher=

    1972

  66. [74]

    CVPR , year =

    Iterative normalization: Beyond standardization towards efficient whitening , author =. CVPR , year =

  67. [75]

    NeurIPS , year =

    Universal Style Transfer via Feature Transforms , author =. NeurIPS , year =

  68. [76]

    CVPR , year =

    RobustNet: Improving Domain Generalization in Urban-Scene Segmentation via Instance Selective Whitening , author =. CVPR , year =

  69. [77]

    ZAMM-Journal of Applied Mathematics and Mechanics/Zeitschrift f

    Iterative berechung der reziproken matrix , author=. ZAMM-Journal of Applied Mathematics and Mechanics/Zeitschrift f. 1933 , publisher=

    1933

  70. [78]

    arXiv preprint arXiv:2104.10935 , year=

    So-vit: Mind visual tokens for vision transformer , author=. arXiv preprint arXiv:2104.10935 , year=

    arXiv

  71. [79]

    ICML , year =

    Batch normalization: Accelerating deep network training by reducing internal covariate shift , author =. ICML , year =

  72. [80]

    ICCV , year =

    Switchable whitening for deep representation learning , author =. ICCV , year =

  73. [81]

    CVPR , year =

    Diversified arbitrary style transfer via deep feature perturbation , author =. CVPR , year =

  74. [82]

    arXiv preprint arXiv:2005.12551 , year=

    Keep it simple: Image statistics matching for domain adaptation , author=. arXiv preprint arXiv:2005.12551 , year=

    2005 arXiv

  75. [83]

    CVPR , year =

    Improved texture networks: Maximizing quality and diversity in feed-forward stylization and texture synthesis , author =. CVPR , year =

  76. [84]

    IEEE transactions on automatic control , volume=

    The matrix sign function , author=. IEEE transactions on automatic control , volume=. 1995 , publisher=

    1995

  77. [85]

    International Journal of Control , volume=

    Linear model reduction and solution of the algebraic Riccati equation by use of the sign function , author=. International Journal of Control , volume=. 1980 , publisher=

    1980

  78. [86]

    Journal of Scientific Computing , volume=

    Solving stable Sylvester equations via rational iterative schemes , author=. Journal of Scientific Computing , volume=. 2006 , publisher=

    2006

  79. [87]

    ICLR , year =

    An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale , author =. ICLR , year =

  80. [88]

    Neurocomputing , year=

    Second-order encoding networks for semantic segmentation , author=. Neurocomputing , year=

  81. [89]

    CVPR , year =

    Second-Order Attention Network for Single Image Super-Resolution , author =. CVPR , year =

  82. [90]

    Master's thesis, University of Tront , year=

    Learning Multiple Layers of Features from Tiny Images , author=. Master's thesis, University of Tront , year=

  83. [91]

    NeurIPS , year =

    Temporal-attentive Covariance Pooling Networks for Video Recognition , author =. NeurIPS , year =

  84. [92]

    ICLR , year =

    Fast Differentiable Matrix Square Root , author =. ICLR , year =

  85. [93]

    CVPR , year =

    The Unreasonable Effectiveness of Deep Features as a Perceptual Metric , author =. CVPR , year =

  86. [94]

    CVPR , year =

    Image-to-image translation with conditional adversarial networks , author =. CVPR , year =

  87. [95]

    Spurious poles in Pad

    Stahl, Herbert , journal=. Spurious poles in Pad. 1998 , publisher=

    1998

  88. [96]

    Defects and the convergence of Pad

    Baker, George A , journal=. Defects and the convergence of Pad. 2000 , publisher=

    2000

  89. [97]

    and Jhuang, H

    Kuehne, H. and Jhuang, H. and Garrote, E. and Poggio, T. and Serre, T. , booktitle =

  90. [98]

    arXiv preprint arXiv:1212.0402 , year=

    UCF101: A dataset of 101 human actions classes from videos in the wild , author=. arXiv preprint arXiv:1212.0402 , year=

    arXiv

  91. [99]

    CVPR , year =

    Tea: Temporal excitation and aggregation for action recognition , author =. CVPR , year =

  92. [100]

    Numerical Algorithms , volume=

    Algorithms for the matrix p th root , author=. Numerical Algorithms , volume=. 2005 , publisher=

    2005

  93. [101]

    NeurIPS , year =

    Attention is all you need , author =. NeurIPS , year =

  94. [102]

    ICLR , year =

    Whitening and Coloring Batch Transform for GANs , author =. ICLR , year =

  95. [103]

    ICML , year =

    Whitening for self-supervised representation learning , author =. ICML , year =

  96. [104]

    CVPR , year =

    Group Whitening: Balancing Learning Efficiency and Representational Capacity , author =. CVPR , year =

  97. [105]

    CVPR , year =

    Stochastic Whitening Batch Normalization , author =. CVPR , year =

  98. [106]

    ECCV , year =

    A closed-form solution to photorealistic image stylization , author =. ECCV , year =

  99. [107]

    ICCV , year =

    Improving Generalization of Batch Whitening by Convolutional Unit Optimization , author =. ICCV , year =

  100. [108]

    IEEE TPAMI , year =

    On the Eigenvalues of Global Covariance Pooling for Fine-grained Visual Recognition , author =. IEEE TPAMI , year =

  101. [109]

    2009 IEEE International Symposium on Parallel & Distributed Processing , pages=

    Singular value decomposition on GPU using CUDA , author=. 2009 IEEE International Symposium on Parallel & Distributed Processing , pages=. 2009 , organization=

    2009

  102. [110]

    CVPR , year =

    Dsac-differentiable ransac for camera localization , author =. CVPR , year =

  103. [111]

    ECCV , year =

    Solving the blind perspective-n-point problem end-to-end with robust differentiable geometric optimization , author =. ECCV , year =

  104. [112]

    IEEE TPAMI , year =

    Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems , author =. IEEE TPAMI , year =

  105. [113]

    Numerische Mathematik , volume=

    A divide and conquer method for the symmetric tridiagonal eigenproblem , author=. Numerische Mathematik , volume=. 1980 , publisher=

    1980

  106. [114]

    SIAM Journal on Matrix Analysis and Applications , volume=

    A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem , author=. SIAM Journal on Matrix Analysis and Applications , volume=. 1995 , publisher=

    1995

  107. [115]

    Part I: Maintaining well-focused shifts and level 3 performance , author=

    The multishift QR algorithm. Part I: Maintaining well-focused shifts and level 3 performance , author=. SIAM Journal on Matrix Analysis and Applications , volume=. 2002 , publisher=

    2002

  108. [116]

    Part II: Aggressive early deflation , author=

    The multishift QR algorithm. Part II: Aggressive early deflation , author=. SIAM Journal on Matrix Analysis and Applications , volume=. 2002 , publisher=

    2002

  109. [117]

    Handbook for Automatic Computation, Volume II, Linear Algebra , year=

    The algebraic eigenvalue problem , author=. Handbook for Automatic Computation, Volume II, Linear Algebra , year=

  110. [118]

    NeurIPS , year =

    Pytorch: An imperative style, high-performance deep learning library , author =. NeurIPS , year =

  111. [119]

    12th USENIX symposium on operating systems design and implementation (OSDI 16) , pages=

    \ TensorFlow \ : A System for \ Large-Scale \ Machine Learning , author=. 12th USENIX symposium on operating systems design and implementation (OSDI 16) , pages=

  112. [120]

    1999 , publisher=

    LAPACK Users' guide , author=. 1999 , publisher=

    1999

  113. [121]

    High-Performance Computing on the Intel

    Intel math kernel library , author=. High-Performance Computing on the Intel. 2014 , publisher=

    2014

  114. [122]

    LAPACK Working Note , volume=

    A new deflation criterion for the QR algorithm , author=. LAPACK Working Note , volume=. 1997 , publisher=

    1997

  115. [123]

    SIAM Journal on Scientific Computing , volume=

    Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD , author=. SIAM Journal on Scientific Computing , volume=. 2013 , publisher=

    2013

  116. [124]

    SIAM Journal on Scientific and Statistical Computing , volume=

    The WY representation for products of Householder matrices , author=. SIAM Journal on Scientific and Statistical Computing , volume=. 1987 , publisher=

    1987

  117. [125]

    The Computer Journal , volume=

    The QR transformation a unitary analogue to the LR transformation—Part 1 , author=. The Computer Journal , volume=. 1961 , publisher=

    1961

  118. [126]

    The Computer Journal , volume=

    The QR transformation—part 2 , author=. The Computer Journal , volume=. 1962 , publisher=

    1962

  119. [127]

    edition , author=

    Matrix Computations. edition , author=. 1996 , publisher=

    1996

  120. [128]

    IEEE transactions on neural networks , year=

    Learning long-term dependencies with gradient descent is difficult , author=. IEEE transactions on neural networks , year=

  121. [129]

    AISTATS , year=

    Understanding the difficulty of training deep feedforward neural networks , author=. AISTATS , year=

  122. [130]

    ICLR , year =

    Exact solutions to the nonlinear dynamics of learning in deep linear neural networks , author =. ICLR , year =

  123. [131]

    ICLR , year =

    ALL YOU NEED IS A GOOD INIT , author =. ICLR , year =

  124. [132]

    ICML , year =

    Dynamical isometry and a mean field theory of cnns: How to train 10,000-layer vanilla convolutional neural networks , author =. ICML , year =

  125. [133]

    ICML , year =

    Deep isometric learning for visual recognition , author =. ICML , year =

  126. [134]

    ICLR , year =

    Regularizing cnns with locally constrained decorrelations , author =. ICLR , year =

  127. [135]

    AAAI , year =

    Complex unitary recurrent neural networks using scaled cayley transform , author =. AAAI , year =

  128. [136]

    Neural networks: Tricks of the trade , pages=

    Efficient backprop , author=. Neural networks: Tricks of the trade , pages=. 2012 , publisher=

    2012

  129. [137]

    NeurIPS , year =

    A convergence analysis of log-linear training , author =. NeurIPS , year =

  130. [138]

    NeurIPS , year =

    Lipschitz-margin training: Scalable certification of perturbation invariance for deep neural networks , author =. NeurIPS , year =

  131. [139]

    ICLR , year =

    The Singular Values of Convolutional Layers , author =. ICLR , year =

  132. [140]

    ICML , year =

    On the importance of initialization and momentum in deep learning , author =. ICML , year =

  133. [141]

    1988 , publisher=

    Matrix nearness problems and applications , author=. 1988 , publisher=

    1988

  134. [142]

    NeurIPS , year =

    Generative adversarial nets , author =. NeurIPS , year =

  135. [143]

    NeurIPS , year =

    Can We Gain More from Orthogonality Regularizations in Training Deep Networks? , author =. NeurIPS , year =

  136. [144]

    ICLR , year =

    Orthogonalizing Convolutional Layers with the Cayley Transform , author =. ICLR , year =

  137. [145]

    ICML , year =

    Skew Orthogonal Convolutions , author =. ICML , year =

  138. [146]

    CVPR , year =

    Orthogonal convolutional neural networks , author =. CVPR , year =

  139. [147]

    ICLR , year =

    Spectral Normalization for Generative Adversarial Networks , author =. ICLR , year =

  140. [148]

    ICML , year =

    On the difficulty of training recurrent neural networks , author =. ICML , year =

  141. [149]

    2021 , publisher=

    Topics in optimal transportation , author=. 2021 , publisher=

    2021

  142. [150]

    2009 , publisher=

    Optimal transport: old and new , author=. 2009 , publisher=

    2009

  143. [151]

    NeurIPS , year =

    Sinkhorn distances: Lightspeed computation of optimal transport , author =. NeurIPS , year =

  144. [152]

    NeurIPS , year =

    Learning with a Wasserstein loss , author =. NeurIPS , year =

  145. [153]

    UAI , year=

    Sinkhorn autoencoders , author=. UAI , year=

  146. [154]

    ICLR , year =

    Improving GANs using optimal transport , author =. ICLR , year =

  147. [155]

    AISTATS , year=

    Interpolating between optimal transport and mmd using sinkhorn divergences , author=. AISTATS , year=

  148. [156]

    NeurIPS , year =

    Faster wasserstein distance estimation with the sinkhorn divergence , author =. NeurIPS , year =

  149. [157]

    CVPR , year =

    A Unified Framework for Implicit Sinkhorn Differentiation , author =. CVPR , year =

  150. [158]

    ICLR , year =

    Wasserstein embedding for graph learning , author =. ICLR , year =

  151. [159]

    ICML , year =

    Wasserstein generative adversarial networks , author =. ICML , year =

  152. [160]

    ICLR , year =

    Wasserstein auto-encoders , author =. ICLR , year =

  153. [161]

    IEEE TNNLS , year =

    Potential flow generator with L 2 optimal transport regularity for generative models , author =. IEEE TNNLS , year =

  154. [162]

    AAAI , year =

    Ot-flow: Fast and accurate continuous normalizing flows via optimal transport , author =. AAAI , year =

  155. [163]

    arXiv preprint arXiv:2204.04853 , year=

    Neural Lagrangian Schr " odinger bridge , author=. arXiv preprint arXiv:2204.04853 , year=

    arXiv

  156. [164]

    ICML , year =

    Action Matching: A Variational Method for Learning Stochastic Dynamics from Samples , author =. ICML , year =

  157. [165]

    Numerische Mathematik , year=

    A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem , author=. Numerische Mathematik , year=

  158. [166]

    ICML , year =

    Trajectorynet: A dynamic optimal transport network for modeling cellular dynamics , author =. ICML , year =

  159. [167]

    ICML , year =

    How to train your neural ODE: the world of Jacobian and kinetic regularization , author =. ICML , year =

  160. [168]

    ICML , year =

    Latent Traversals in Generative Models as Potential Flows , author =. ICML , year =

  161. [169]

    2019 , author =

    Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations , journal =. 2019 , author =

    2019

  162. [170]

    IEEE T-PAMI , year=

    Representation learning: A review and new perspectives , author=. IEEE T-PAMI , year=

  163. [171]

    NeurIPS , year =

    Infogan: Interpretable representation learning by information maximizing generative adversarial nets , author =. NeurIPS , year =

  164. [172]

    ICLR , year =

    beta-vae: Learning basic visual concepts with a constrained variational framework , author =. ICLR , year =

  165. [173]

    Neural computation , year=

    Learning factorial codes by predictability minimization , author=. Neural computation , year=

  166. [174]

    ICLR , year =

    Auto-encoding variational bayes , author =. ICLR , year =

  167. [175]

    ICML , year =

    Learning discrete and continuous factors of data via alternating disentanglement , author =. ICML , year =

  168. [176]

    ICLR , year =

    Deep unsupervised clustering with gaussian mixture variational autoencoders , author =. ICLR , year =

  169. [177]

    AAAI , year =

    Hyperbolic disentangled representation for fine-grained aspect extraction , author =. AAAI , year =

  170. [178]

    ICML , year =

    Disentangling by factorising , author =. ICML , year =

  171. [179]

    NeurIPS , year =

    Isolating sources of disentanglement in variational autoencoders , author =. NeurIPS , year =

  172. [180]

    ICLR , year =

    Variational inference of disentangled latent concepts from unlabeled observations , author =. ICLR , year =

  173. [181]

    CVPR , year =

    Guided variational autoencoder for disentanglement learning , author =. CVPR , year =

  174. [182]

    NeurIPS , year =

    Learning disentangled joint continuous and discrete representations , author =. NeurIPS , year =

  175. [183]

    ECCV , year =

    Learning disentangled representations with latent variation predictability , author =. ECCV , year =

  176. [184]

    ECCV , year =

    The hessian penalty: A weak prior for unsupervised disentanglement , author =. ECCV , year =

  177. [185]

    ICCV , year =

    Orthogonal jacobian regularization for unsupervised disentanglement in image generation , author =. ICCV , year =

  178. [186]

    IEEE T-PAMI , year=

    Orthogonal SVD Covariance Conditioning and Latent Disentanglement , author=. IEEE T-PAMI , year=

  179. [187]

    NeurIPS , year =

    Low-rank subspaces in gans , author =. NeurIPS , year =

  180. [188]

    ICML , year =

    Region-Based Semantic Factorization in GANs , author =. ICML , year =

  181. [189]

    CVPR , year =

    Closed-form factorization of latent semantics in gans , author =. CVPR , year =

  182. [190]

    ICLR , year =

    PandA: Unsupervised Learning of Parts and Appearances in the Feature Maps of GANs , author =. ICLR , year =

  183. [191]

    Tzelepis, Christos and Tzimiropoulos, Georgios and Patras, Ioannis , booktitle =

  184. [192]

    ICLR , year =

    Diffusion models already have a semantic latent space , author =. ICLR , year =

  185. [193]

    arXiv preprint arXiv:2302.12469 , year=

    Unsupervised Discovery of Semantic Latent Directions in Diffusion Models , author=. arXiv preprint arXiv:2302.12469 , year=

    arXiv

  186. [194]

    arXiv preprint arXiv:2301.13721 , year=

    DisDiff: Unsupervised Disentanglement of Diffusion Probabilistic Models , author=. arXiv preprint arXiv:2301.13721 , year=

    arXiv

  187. [195]

    NeurIPS , year =

    Ganspace: Discovering interpretable gan controls , author =. NeurIPS , year =

  188. [196]

    ICML , year =

    Unsupervised discovery of interpretable directions in the gan latent space , author =. ICML , year =

  189. [197]

    ICCV , year =

    Ganalyze: Toward visual definitions of cognitive image properties , author =. ICCV , year =

  190. [198]

    steerability

    On the" steerability" of generative adversarial networks , author =. ICLR , year =

  191. [199]

    ICANN , year=

    Transforming auto-encoders , author=. ICANN , year=

  192. [200]

    CVPR , year =

    Understanding image representations by measuring their equivariance and equivalence , author =. CVPR , year =

  193. [201]

    ICCV , year =

    Learning to see by moving , author =. ICCV , year =

  194. [202]

    CVPR , year =

    Learning rotation-aware features: From invariant priors to equivariant descriptors , author =. CVPR , year =

  195. [203]

    AISTATS , year=

    Deeply-supervised nets , author=. AISTATS , year=

  196. [204]

    ICML , year =

    Group equivariant convolutional networks , author =. ICML , year =

  197. [205]

    ICML , year =

    Generalizing convolutional neural networks for equivariance to lie groups on arbitrary continuous data , author =. ICML , year =

  198. [206]

    ICLR , year =

    Steerable cnns , author =. ICLR , year =

  199. [207]

    NeurIPS , year =

    Mdp homomorphic networks: Group symmetries in reinforcement learning , author =. NeurIPS , year =

  200. [208]

    ICML , year =

    Equivariance through parameter-sharing , author =. ICML , year =

  201. [209]

    NeurIPS , year =

    Deep scale-spaces: Equivariance over scale , author =. NeurIPS , year =

  202. [210]

    CVPR , year =

    Harmonic networks: Deep translation and rotation equivariance , author =. CVPR , year =

  203. [211]

    AISTATS , year=

    Variational autoencoder with learned latent structure , author=. AISTATS , year=

  204. [212]

    NeurIPS , year =

    Topographic vaes learn equivariant capsules , author =. NeurIPS , year =

  205. [213]

    ICML , year =

    Learning to convolve: A generalized weight-tying approach , author =. ICML , year =

  206. [214]

    ICML , year =

    Equivariant diffusion for molecule generation in 3d , author =. ICML , year =

  207. [215]

    The MNIST database of handwritten digits , author=

  208. [216]

    Loic Matthey and Irina Higgins and Demis Hassabis and Alexander Lerchner , title =. 2017

    2017

  209. [217]

    3D Shapes Dataset , author=

  210. [218]

    ICLR , year =

    Towards nonlinear disentanglement in natural data with temporal sparse coding , author =. ICLR , year =

  211. [219]

    ICLR , year =

    Categorical reparameterization with gumbel-softmax , author =. ICLR , year =

  212. [220]

    ICML , year =

    Variational inference with normalizing flows , author =. ICML , year =

  213. [221]

    NeurIPS , year =

    Glow: Generative flow with invertible 1x1 convolutions , author =. NeurIPS , year =

  214. [222]

    ICLR , year =

    Density estimation using real nvp , author =. ICLR , year =

  215. [223]

    arXiv preprint arXiv:1308.3432 , year=

    Estimating or propagating gradients through stochastic neurons for conditional computation , author=. arXiv preprint arXiv:1308.3432 , year=

    arXiv

  216. [224]

    ICLR , year =

    Group equivariant generative adversarial networks , author =. ICLR , year =

  217. [225]

    ICML , year =

    Equivariant flows: exact likelihood generative learning for symmetric densities , author =. ICML , year =

  218. [226]

    NeurIPS , year =

    E (n) equivariant normalizing flows , author =. NeurIPS , year =

  219. [227]

    arXiv preprint arXiv:1812.02230 , year=

    Towards a definition of disentangled representations , author=. arXiv preprint arXiv:1812.02230 , year=

    arXiv

  220. [228]

    ICLR , year =

    Transformation properties of learned visual representations , author =. ICLR , year =

  221. [229]

    ICLR , year =

    Competitive Physics Informed Networks , author =. ICLR , year =

  222. [230]

    Machine Learning: Science and Technology , year=

    Recipes for when Physics Fails: Recovering Robust Learning of Physics Informed Neural Networks , author=. Machine Learning: Science and Technology , year=

  223. [231]

    NeurIPS , year =

    Neural conservation laws: A divergence-free perspective , author =. NeurIPS , year =

  224. [232]

    ICLR , year =

    Learning neural PDE solvers with convergence guarantees , author =. ICLR , year =

  225. [233]

    ICLR , year =

    Message passing neural PDE solvers , author =. ICLR , year =

  226. [234]

    AISTATS , year=

    VAE with a VampPrior , author=. AISTATS , year=

  227. [235]

    ICML , year =

    Weakly-supervised disentanglement without compromises , author =. ICML , year =

  228. [236]

    NeurIPS , year =

    Learning deep disentangled embeddings with the f-statistic loss , author =. NeurIPS , year =

  229. [237]

    ICLR , year =

    A framework for the quantitative evaluation of disentangled representations , author =. ICLR , year =

  230. [238]

    2019 , eprint=

    Neural Ordinary Differential Equations , author=. 2019 , eprint=

    2019

  231. [239]

    NeurIPS , year =

    Language models are few-shot learners , author =. NeurIPS , year =

  232. [240]

    nature , year=

    Deep learning , author=. nature , year=

  233. [241]

    arXiv preprint arXiv:2102.05623 , year=

    Addressing the topological defects of disentanglement via distributed operators , author=. arXiv preprint arXiv:2102.05623 , year=

    arXiv

  234. [242]

    Nature communications , year=

    Unsupervised deep learning identifies semantic disentanglement in single inferotemporal face patch neurons , author=. Nature communications , year=

  235. [243]

    ICLR , year =

    Disentanglement with biological constraints: A theory of functional cell types , author =. ICLR , year =

  236. [244]

    ICML , year =

    Semi-supervised stylegan for disentanglement learning , author =. ICML , year =

  237. [245]

    ICLR , year =

    DAVA: Disentangling Adversarial Variational Autoencoder , author =. ICLR , year =

  238. [246]

    ICML , year =

    Controlvae: Controllable variational autoencoder , author =. ICML , year =

  239. [247]

    ICML Workshop , year=

    Latent Space Editing in Transformer-Based Flow Matching , author=. ICML Workshop , year=

  240. [248]

    NeurIPS , year =

    ODE2VAE: Deep generative second order ODEs with Bayesian neural networks , author =. NeurIPS , year =

  241. [249]

    ICLR , year =

    Unsupervised representation learning with deep convolutional generative adversarial networks , author =. ICLR , year =

  242. [250]

    ICLR , year =

    Progressive growing of gans for improved quality, stability, and variation , author =. ICLR , year =

  243. [251]

    ICLR , year =

    Large scale GAN training for high fidelity natural image synthesis , author =. ICLR , year =

  244. [252]

    CVPR , year =

    A style-based generator architecture for generative adversarial networks , author =. CVPR , year =

  245. [253]

    CVPR , year =

    Analyzing and improving the image quality of stylegan , author =. CVPR , year =

  246. [254]

    NeurIPS , year =

    Alias-free generative adversarial networks , author =. NeurIPS , year =

  247. [255]

    NeurIPS , year =

    Training generative adversarial networks with limited data , author =. NeurIPS , year =

  248. [256]

    CVPR , year =

    Stylesdf: High-resolution 3d-consistent image and geometry generation , author =. CVPR , year =

  249. [257]

    ICLR , year =

    Stylenerf: A style-based 3d-aware generator for high-resolution image synthesis , author =. ICLR , year =

  250. [258]

    Chan and Connor Z

    Eric R. Chan and Connor Z. Lin and Matthew A. Chan and Koki Nagano and Boxiao Pan and Shalini De Mello and Orazio Gallo and Leonidas Guibas and Jonathan Tremblay and Sameh Khamis and Tero Karras and Gordon Wetzstein , booktitle =. Efficient Geometry-aware

  251. [259]

    CVPR , year =

    Stylegan-v: A continuous video generator with the price, image quality and perks of stylegan2 , author =. CVPR , year =

  252. [260]

    ACM SIGGRAPH , year=

    Stylegan-xl: Scaling stylegan to large diverse datasets , author=. ACM SIGGRAPH , year=

  253. [261]

    NeurIPS , year =

    Neural ordinary differential equations , author =. NeurIPS , year =

  254. [262]

    Physical review letters , volume=

    Discovering physical concepts with neural networks , author=. Physical review letters , volume=. 2020 , publisher=

    2020

  255. [263]

    ICLR , year =

    Spherical cnns , author =. ICLR , year =

  256. [264]

    ICML , year =

    Making convolutional networks shift-invariant again , author =. ICML , year =

  257. [265]

    NeurIPS , year =

    Hamiltonian neural networks , author =. NeurIPS , year =

  258. [266]

    ICLR , year =

    Hamiltonian generative networks , author =. ICLR , year =

  259. [267]

    NeurIPS , year =

    Denoising diffusion probabilistic models , author =. NeurIPS , year =

  260. [268]

    ICLR , year =

    Denoising diffusion implicit models , author =. ICLR , year =

  261. [269]

    ICLR , year =

    Score-based generative modeling through stochastic differential equations , author =. ICLR , year =

  262. [270]

    ICLR , year =

    Controlling generative models with continuous factors of variations , author =. ICLR , year =

  263. [271]

    CVPR , year =

    Interpreting the latent space of gans for semantic face editing , author =. CVPR , year =

  264. [272]

    NeurIPS , year =

    Editgan: High-precision semantic image editing , author =. NeurIPS , year =

  265. [273]

    CVPR , year =

    SemanticStyleGAN: Learning Compositional Generative Priors for Controllable Image Synthesis and Editing , author =. CVPR , year =

  266. [274]

    ICLR , year =

    Do not escape from the manifold: Discovering the local coordinates on the latent space of GANs , author =. ICLR , year =

  267. [275]

    ECCV , year =

    Hierarchical Semantic Regularization of Latent Spaces in StyleGANs , author =. ECCV , year =

  268. [276]

    Steerability

    GAN" Steerability" without optimization , author =. ICLR , year =

  269. [277]

    ICLR , year =

    Learning disentangled representation by exploiting pretrained generative models: A contrastive learning view , author =. ICLR , year =

  270. [278]

    ECCV , year =

    Rayleigh EigenDirections (REDs): GAN latent space traversals for multidimensional features , author =. ECCV , year =

  271. [279]

    CVPR , year =

    Eigengan: Layer-wise eigen-learning for gans , author =. CVPR , year =

  272. [280]

    2019 , url =

    Brian Chao , title =. 2019 , url =

    2019

  273. [281]

    CVPR , year =

    One millisecond face alignment with an ensemble of regression trees , author =. CVPR , year =

  274. [282]

    Liu, Ziwei and Luo, Ping and Wang, Xiaogang and Tang, Xiaoou , title=

  275. [283]

    arXiv preprint arXiv:1506.03365 , year=

    Lsun: Construction of a large-scale image dataset using deep learning with humans in the loop , author=. arXiv preprint arXiv:1506.03365 , year=

    arXiv

  276. [284]

    NeurIPS , year =

    Gans trained by a two time-scale update rule converge to a local nash equilibrium , author =. NeurIPS , year =

  277. [285]

    ICML , year =

    Efficient orthogonal parametrisation of recurrent neural networks using householder reflections , author =. ICML , year =

  278. [286]

    ICML , year =

    Stabilizing gradients for deep neural networks via efficient svd parameterization , author =. ICML , year =

  279. [287]

    NeurIPS , year =

    What if neural networks had SVDs? , author =. NeurIPS , year =

  280. [288]

    Journal of the ACM (JACM) , volume=

    Unitary triangularization of a nonsymmetric matrix , author=. Journal of the ACM (JACM) , volume=. 1958 , publisher=

    1958

  281. [289]

    ACM Transactions on Mathematical Software (TOMS) , volume=

    The computation of elementary unitary matrices , author=. ACM Transactions on Mathematical Software (TOMS) , volume=. 1996 , publisher=

    1996

  282. [290]

    ECCV , year =

    StyleGAN-Human: A Data-Centric Odyssey of Human Generation , author =. ECCV , year =

  283. [291]

    CVPR , year =

    Stargan v2: Diverse image synthesis for multiple domains , author =. CVPR , year =

  284. [292]

    ACM TOG , year=

    Pivotal tuning for latent-based editing of real images , author=. ACM TOG , year=

  285. [293]

    Cambridge mathematical library: Hydrodynamics

    Lamb, Horace. Cambridge mathematical library: Hydrodynamics

  286. [294]

    Proceedings of the IEEE , year=

    Gradient-based learning applied to document recognition , author=. Proceedings of the IEEE , year=

  287. [295]

    ICCV , year =

    S3fd: Single shot scale-invariant face detector , author =. ICCV , year =

  288. [296]

    CVPR , year =

    Arcface: Additive angular margin loss for deep face recognition , author =. CVPR , year =

  289. [297]

    WACV , year=

    Fairface: Face attribute dataset for balanced race, gender, and age for bias measurement and mitigation , author=. WACV , year=

  290. [298]

    CVPR , year =

    Hope-net: A graph-based model for hand-object pose estimation , author =. CVPR , year =

  291. [299]

    ICLR , year =

    Latent space oddity: on the curvature of deep generative models , author =. ICLR , year =

  292. [300]

    arXiv preprint arXiv:2011.06070 , year=

    Quantifying and Learning Linear Symmetry-Based Disentanglement , author=. arXiv preprint arXiv:2011.06070 , year=

    2011 arXiv

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.