new

Get trending papers in your email inbox!

Subscribe

Daily Papers

byAK and the research community

Aug 31

Lie Group Decompositions for Equivariant Neural Networks

Invariance and equivariance to geometrical transformations have proven to be very useful inductive biases when training (convolutional) neural network models, especially in the low-data regime. Much work has focused on the case where the symmetry group employed is compact or abelian, or both. Recent work has explored enlarging the class of transformations used to the case of Lie groups, principally through the use of their Lie algebra, as well as the group exponential and logarithm maps. The applicability of such methods to larger transformation groups is limited by the fact that depending on the group of interest G, the exponential map may not be surjective. Further limitations are encountered when G is neither compact nor abelian. Using the structure and geometry of Lie groups and their homogeneous spaces, we present a framework by which it is possible to work with such groups primarily focusing on the Lie groups G = GL^{+}(n, R) and G = SL(n, R), as well as their representation as affine transformations R^{n} rtimes G. Invariant integration as well as a global parametrization is realized by decomposing the `larger` groups into subgroups and submanifolds which can be handled individually. Under this framework, we show how convolution kernels can be parametrized to build models equivariant with respect to affine transformations. We evaluate the robustness and out-of-distribution generalisation capability of our model on the standard affine-invariant benchmark classification task, where we outperform all previous equivariant models as well as all Capsule Network proposals.

  • 2 authors
·
Oct 17, 2023

Estimating Photometric Redshifts for Galaxies from the DESI Legacy Imaging Surveys with Bayesian Neural Networks Trained by DESI EDR

We present a catalogue of photometric redshifts for galaxies from DESI Legacy Imaging Surveys, which includes sim0.18 billion sources covering 14,000 {rm deg}^2. The photometric redshifts, along with their uncertainties, are estimated through galaxy images in three optical bands (g, r and z) from DESI and two near-infrared bands (W1 and W2) from WISE using a Bayesian Neural Network (BNN). The training of BNN is performed by above images and their corresponding spectroscopic redshifts given in DESI Early Data Release (EDR). Our results show that categorizing galaxies into individual groups based on their inherent characteristics and estimating their photo-zs within their group separately can effectively improve the performance. Specifically, the galaxies are categorized into four distinct groups based on DESI's target selection criteria: Bright Galaxy Sample (BGS), Luminous Red Galaxies (LRG), Emission Line Galaxies (ELG) and a group comprising the remaining sources, referred to as NON. As measured by outliers of |Δz| > 0.15 (1 + z_{rm true}), accuracy σ_{rm NMAD} and mean uncertainty E for BNN, we achieve low outlier percentage, high accuracy and low uncertainty: 0.14%, 0.018 and 0.0212 for BGS and 0.45%, 0.026 and 0.0293 for LRG respectively, surpassing results without categorization. However, the photo-zs for ELG cannot be reliably estimated, showing result of >15%, sim0.1 and sim0.1 irrespective of training strategy. On the other hand, NON sources can reach 1.9%, 0.039 and 0.0445 when a magnitude cut of z<21.3 is applied. Our findings demonstrate that estimating photo-zs directly from galaxy images is significantly potential, and to achieve high-quality photo-z measurement for ongoing and future large-scale imaging survey, it is sensible to implement categorization of sources based on their characteristics.

  • 9 authors
·
Dec 2, 2024

Distinguishability and linear independence for H-chromatic symmetric functions

We study the H-chromatic symmetric functions X_G^H (introduced in (arXiv:2011.06063) as a generalization of the chromatic symmetric function (CSF) X_G), which track homomorphisms from the graph G to the graph H. We focus first on the case of self-chromatic symmetric functions (self-CSFs) X_G^G, making some progress toward a conjecture from (arXiv:2011.06063) that the self-CSF, like the normal CSF, is always different for different trees. In particular, we show that the self-CSF distinguishes trees from non-trees with just one exception, we check using Sage that it distinguishes all trees on up to 12 vertices, and we show that it determines the number of legs of a spider and the degree sequence of a caterpillar given its spine length. We also show that the self-CSF detects the number of connected components of a forest, again with just one exception. Then we prove some results about the power sum expansions for H-CSFs when H is a complete bipartite graph, in particular proving that the conjecture from (arXiv:2011.06063) about p-monotonicity of ω(X_G^H) for H a star holds as long as H is sufficiently large compared to G. We also show that the self-CSFs of complete multipartite graphs form a basis for the ring Λ of symmetric functions, and we give some construction of bases for the vector space Λ^n of degree n symmetric functions using H-CSFs X_G^H where H is a fixed graph that is not a complete graph, answering a question from (arXiv:2011.06063) about whether such bases exist. However, we show that there generally do not exist such bases with G fixed, even with loops, answering another question from (arXiv:2011.06063). We also define the H-chromatic polynomial as an analogue of the chromatic polynomial, and ask when it is the same for different graphs.

  • 2 authors
·
Nov 11, 2025