Semi-analytic models are best suited to compare galaxy formation and evolution theories with observations. These models rely heavily on halo merger trees, and their realistic features (i.e., no drastic changes on halo mass or jumps on physical locations). Our aim is to provide a new framework for halo merger tree gener…
Introduces halo products and studies their geometric properties.
problem Understanding the large-scale geometry of halo groups.
method Introduces halo products and builds a geometric framework.
result Provides refined invariants distinguishing halo groups up to quasi-isometry.
HALO uses local Lipschitz constants to optimize functions efficiently.
problem Efficiently solving global optimization problems with complex objective functions.
method Hybrid Adaptive Lipschizian Optimization (HALO) algorithm that estimates local Lipschitz constants and balances global and local information.
result HALO outperforms other global optimization algorithms on numerous test functions.
Generative model disentangles dark matter halo properties.
problem Entangling physical factors in generative model latent spaces.
method Auxiliary-variable-guided framework with halo mass and concentration.
result Reveals mass-concentration scaling relation and identifies unusual halo formation.
Core-Halo solves large-scale fixed-point problems by decentralizing updates.
problem Large-scale fixed-point equations with block dependencies.
method Core-Halo decomposition separates write ownership from read-only context, aligning with block-dependence structure.
result Core-Halo achieves near-centralized performance while retaining parallelism.
New geodesic rays found on hyperbolic surfaces with unique halo.
problem Existence of geodesic rays not asymptotic to lamination leaves.
method Analyzing intersections and lifts of measured geodesic laminations.
result Uncountable halo of geodesic endpoints disjoint from lamination leaves.
CHARM creates mock halo catalogs from dark matter density fields using neural networks.
problem Creating accurate mock halo catalogs for cosmological studies is computationally expensive.
method CHARM uses multi-stage neural spline flow networks to learn the mapping from dark matter density fields to halo catalogs.
result Mock halo catalogs have the same statistical properties as those from high-resolution N-body simulations.
HALO learns to prune neural networks by adaptively shrinking weights.
problem Sparsity and model size in deep neural networks.
method Bayesian hierarchical models and trainable parameters for adaptive sparsification.
result HALO learns to create highly sparse networks with significant performance gains.
Neural net reconstructs dark matter density from halo velocities.
problem Reconstructing local dark matter density from halo velocities.
method Hybrid architecture combining U-Net and DeepSets.
result Hybrid network recovers density amplitudes and phases better than U-Net.
New method extracts cosmological information from dark matter halo catalogues using graph neural networks.
problem Quantifying cosmological information from large-scale structure data.
method Implicit likelihood approach with Information Maximising Neural Networks (IMNNs) on graph representations of dark matter halo catalogues.
result Graph neural network summaries can extract information from noisy catalogues and improve parameter constraints.
Study lampshuffler groups' isoperimetric profiles, refining previous estimates.
problem Relate isoperimetric profiles of lampshuffler groups to their base groups.
method Use lamplighter subgraphs and halo products to find optimal upper bounds.
result Sharp estimates for exponential growth groups, including Brieussel-Zheng groups.
Point clouds, as a form of Lagrangian representation, allow for powerful and flexible applications in a large number of computational disciplines. We propose a novel deep-learning method to learn stable and temporally coherent feature spaces for points clouds that change over time. We identify a set of inherent problem…
Hybrid model speeds up galaxy simulations by incorporating baryonic properties.
problem Inaccurate baryonic properties in dark matter-only simulations.
method Combining analytic models and machine learning for faster, more accurate simulations.
result Hybrid model outperforms machine learning alone for some baryonic properties.
Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribut…
A new method models galaxies as points in space for better analysis.
problem Limitations of binning and voxelization in galaxy surveys.
method A diffusion-based generative model for galaxy point clouds.
result Demonstrated on dark matter haloes in Quijote simulations.
Linear algebra approach for parallel deep learning models.
problem Training large DNNs in distributed environments.
method Linear algebraic approach to model parallelism.
result Manual development of backward operators for gradient-based training.
Cluster-wise linear regression (CLR), a clustering problem intertwined with regression, is to find clusters of entities such that the overall sum of squared errors from regressions performed over these clusters is minimized, where each cluster may have different variances. We generalize the CLR problem by allowing each…
The paper reduces normal curvature and enhances homology recovery via embedded submanifolds.
problem Recovering the homology of submanifolds with narrow cycles.
method Embedding submanifolds into scaled oriented Grassmannian bundles to reduce normal curvature and stabilize Čech persistent homology.
result The Čech persistent homology is stable with respect to the interleaving distance and provides lower bounds on scales for homology recovery.
Physics-informed neural networks improve baryonic predictions from dark matter simulations.
problem Recreating hydrodynamic simulations from dark matter requires expensive and time-consuming computations.
method Combining neural network architectures with physical constraints and using Kullback-Leibler divergence for prediction comparison.
result Improved accuracy of baryonic predictions based on dark matter halo properties, successful recovery of the metallicity relation, and preserved scatter.
Dark matter in the universe evolves through gravity to form a complex network of halos, filaments, sheets and voids, that is known as the cosmic web. Computational models of the underlying physical processes, such as classical N-body simulations, are extremely resource intensive, as they track the action of gravity in …
ST-STORM separates semantic and appearance features for robust representation learning.
problem Traditional SSL methods fail to capture appearance cues in critical applications.
method Hybrid SSL framework with two latent streams, Content and Style, disentangled through gating mechanisms.
result The Style branch effectively isolates complex appearance phenomena without degrading semantic performance.
Classifies geodesic planes outside convex core of geometrically finite 3-manifolds.
problem Classifying geodesic planes in geometrically finite 3-manifolds.
method Constructive proof involving exotic rays and roofs.
result Existence of exotic roofs depends on the existence of exotic rays and bending lamination properties.