Search

Shortcut learning, where machine learning models exploit spurious correlations in data instead of capturing meaningful features, poses a significant challenge to building robust and generalizable models. This phenomenon is prevalent across various machine learning applications, including vision, natural language processing, and speech recognition, where models may find unintended cues that minimize training loss but fail to capture the underlying structure of the data. Vision classifiers such as Convolutional Neural Networks (CNNs), Multi-Layer Perceptrons (MLPs), and Vision Transformers (ViTs) leverage distinct architectural principles to process spatial and structural information, making them differently susceptible to shortcut learning. In this study, we systematically evaluate these architectures by introducing deliberate shortcuts into the dataset that are positionally correlated with class labels, creating a controlled setup to assess whether models rely on these artificial cues or learn actual distinguishing features. We perform both quantitative evaluation by training on the shortcut-modified dataset and testing them on two different test sets -- one containing the same shortcuts and another without them -- to determine the extent of reliance on shortcuts. Additionally, qualitative evaluation is performed by using network inversion-based reconstruction techniques to analyze what the models internalize in their weights, aiming to reconstruct the training data as perceived by the classifiers. We evaluate shortcut learning behavior across multiple benchmark datasets, including MNIST, Fashion-MNIST, SVHN, and CIFAR-10, to compare the susceptibility of different vision classifier architectures to shortcut reliance and assess their varying degrees of sensitivity to spurious correlations.

Vision classifiers are often trained on proprietary datasets containing sensitive information, yet the models themselves are frequently shared openly under the privacy-preserving assumption. Although these models are assumed to protect sensitive information in their training data, the extent to which this assumption holds for different architectures remains unexplored. This assumption is challenged by inversion attacks which attempt to reconstruct training data from model weights, exposing significant privacy vulnerabilities. In this study, we systematically evaluate the privacy-preserving properties of vision classifiers across diverse architectures, including Multi-Layer Perceptrons (MLPs), Convolutional Neural Networks (CNNs), and Vision Transformers (ViTs). Using network inversion-based reconstruction techniques, we assess the extent to which these architectures memorize and reveal training data, quantifying the relative ease of reconstruction across models. Our analysis highlights how architectural differences, such as input representation, feature extraction mechanisms, and weight structures, influence privacy risks. By comparing these architectures, we identify which are more resilient to inversion attacks and examine the trade-offs between model performance and privacy preservation, contributing to the development of secure and privacy-respecting machine learning models for sensitive applications. Our findings provide actionable insights into the design of secure and privacy-aware machine learning systems, emphasizing the importance of evaluating architectural decisions in sensitive applications involving proprietary or personal data.

High-level synthesis (HLS) has enabled the rapid development of custom hardware circuits for many software applications. However, developing high-performance hardware circuits using HLS is still a non-trivial task requiring expertise in hardware design. Further, the hardware design space, especially for multi-kernel applications, grows exponentially. Therefore, several HLS automation and abstraction frameworks have been proposed recently, but many issues remain unresolved. These issues include: 1) relying mainly on hardware directives (pragmas) to apply hardware optimizations without exploring loop scheduling opportunities. 2) targeting single-kernel applications only. 3) lacking automatic and/or global design space exploration. 4) missing critical hardware optimizations, such as graph-level pipelining for multi-kernel applications. To address these challenges, we propose a novel methodology and framework on top of the popular multi-level intermediate representation (MLIR) infrastructure called Stream-HLS. Our framework takes a C/C++ or PyTorch software code and automatically generates an optimized dataflow architecture along with host code for field-programmable gate arrays (FPGAs). To achieve this, we developed an accurate analytical performance model for global scheduling and optimization of dataflow architectures. Stream-HLS is evaluated using various standard HLS benchmarks and real-world benchmarks from transformer models, convolution neural networks, and multilayer perceptrons. Stream-HLS designs outperform the designs of prior state-of-the-art automation frameworks and manually-optimized designs of abstraction frameworks by up to $79.43\times$ and $10.62\times$ geometric means respectively. Finally, the Stream-HLS framework is modularized, extensible, and open-sourced at \url{https://github.com/UCLA-VAST/Stream-HLS} (\url{https://doi.org/10.5281/zenodo.14585909}).

Collective motion is a phenomenon observed across length scales in nature, from bacterial swarming and tissue migration to the flocking of animals. The mechanisms underlying this behavior vary significantly depending on the biological system, ranging from hydrodynamic and chemical interactions in bacteria to mechanical forces in epithelial tissues and social alignment in animal groups. While collective motion often arises from the coordinated activity of independently motile agents, this work explores a novel context: the emergence of collective motion in systems of non-motile active agents. Inspired by the oscillatory shape dynamics observed in suspended cells such as neutrophils and fibroblasts, we model active dumbbells exhibiting limit-cycle oscillations in shape as a minimal representation of such systems.Through computational simulations, we demonstrate that hydrodynamic interactions between these dumbbells lead to three key phenomena: a density-dependent transition from sessile to collective motion, hydrodynamics-induced phase separation, and synchronization of oscillatory shape changes. We have explored the role of hydrodynamic interactions on these emergent properties of sessile active dumbbells. These results underscore the critical role of hydrodynamic coupling in enabling and organizing collective behaviors in systems lacking intrinsic motility. This study lays the groundwork for future investigations into the emergent behavior of active matter and its implications for understanding cell motility, tissue dynamics, and the development of bio-inspired materials.

To date, only two strongly lensed type Ia supernovae (SNIa) have been discovered with an isolated galaxy acting as the lens: iPTF16geu and SN Zwicky. The observed image fluxes for both lens systems were inconsistent with predictions from a smooth macro lens model. A potential explanation for the anomalous flux ratios is microlensing: additional (de)magnification caused by stars and other compact objects in the lens galaxy. In this work, we combine observations of iPTF16geu and SN Zwicky with simulated microlensing magnification maps, leveraging their standardizable candle properties to constrain the lens galaxy mass slope, $\eta$, and the fraction of dark compact objects, $f_{\rm dc}$. The resulting mass slopes are $\eta = 1.70 \pm 0.07$ for iPTF16geu and $\eta = 1.81 \pm 0.10$ for SN Zwicky. Our results indicate no evidence for a population of dark compact objects, placing upper limits at the $95\%$ confidence level of $f_{\rm dc} < 0.25$ for iPTF16geu and $f_{\rm dc} < 0.47$ for SN Zwicky. Assuming a constant fraction of dark compact objects for both lensed SNe, we obtain $f_{\rm dc} < 0.19$. These results highlight the potential of strongly lensed SNIa to probe the innermost parts of lens galaxies and learn about compact matter., Comment: 19 pages, 12 figures

Image tokenizers map images to sequences of discrete tokens, and are a crucial component of autoregressive transformer-based image generation. The tokens are typically associated with spatial locations in the input image, arranged in raster scan order, which is not ideal for autoregressive modeling. In this paper, we propose to tokenize the image spectrum instead, obtained from a discrete wavelet transform (DWT), such that the sequence of tokens represents the image in a coarse-to-fine fashion. Our tokenizer brings several advantages: 1) it leverages that natural images are more compressible at high frequencies, 2) it can take and reconstruct images of different resolutions without retraining, 3) it improves the conditioning for next-token prediction -- instead of conditioning on a partial line-by-line reconstruction of the image, it takes a coarse reconstruction of the full image, 4) it enables partial decoding where the first few generated tokens can reconstruct a coarse version of the image, 5) it enables autoregressive models to be used for image upsampling. We evaluate the tokenizer reconstruction metrics as well as multiscale image generation, text-guided image upsampling and editing.

We present a scheme for achieving broadband complete reflection by constructing photonic bandgap via collective atom-atom interaction in a one-dimensional (1D) waveguide quantum electrodynamics (QED) system. Moreover, we propose several strategies to further expand the ultrahigh reflection windows, including increasing the number of atoms with separations near the Bragg distance and inducing gradient frequency modulation among the atoms. The center frequency and bandwidth of the ultrahigh reflection window are dynamically adjustable by applying external electromagnetic field. The results here can enrich the many-body physics of waveguide-QED system and offer a pathway for achieving broadened ultrahigh reflection in a controllable way, which can find important applications in the realms of chip-integrated band filter, quantum storage, optical switching, and wavelength-selective devices.

Latent variable generative models have emerged as powerful tools for generative tasks including image and video synthesis. These models are enabled by pretrained autoencoders that map high resolution data into a compressed lower dimensional latent space, where the generative models can subsequently be developed while requiring fewer computational resources. Despite their effectiveness, the direct application of latent variable models to higher dimensional domains such as videos continues to pose challenges for efficient training and inference. In this paper, we propose an autoencoder that projects volumetric data onto a four-plane factorized latent space that grows sublinearly with the input size, making it ideal for higher dimensional data like videos. The design of our factorized model supports straightforward adoption in a number of conditional generation tasks with latent diffusion models (LDMs), such as class-conditional generation, frame prediction, and video interpolation. Our results show that the proposed four-plane latent space retains a rich representation needed for high-fidelity reconstructions despite the heavy compression, while simultaneously enabling LDMs to operate with significant improvements in speed and memory.

If all the zeros of $n$th degree polynomials $f(z)$ and $g(z) = \sum_{k=0}^{n}\lambda_k\binom{n}{k}z^k$ respectively lie in the cricular regions $|z|\leq r$ and $|z| \leq s|z-\sigma|$, $s>0$, then it was proved by Marden \cite[p. 86]{mm} that all the zeros of the polynomial $h(z)= \sum_{k=0}^{n}\lambda_k f^{(k)}(z) \frac{(\sigma z)^k}{k!}$ lie in the circle $|z| \leq r ~ \max(1,s)$. In this paper, we relax the condition that $f(z)$ and $g(z)$ are of the same degree and instead assume that $f(z)$ and $g(z)$ are polynomials of arbitrary degree $n$ and $m$ respectively, $m\leq n,$ and obtain a generalization of this result. As an application, we also introduce a linear operator which preserve Bernstein type polynomial inequalities., Comment: Polynomials, Operators, Inequalities in the complex domain

If $P(z)=\sum_{j=0}^{n}a_jz^j$ is a polynomial of degree $n$ having no zero in $|z|<1,$ then it was recently proved that for every $p\in[0,+\infty]$ and $s=0,1,\ldots,n-1,$ \begin{align*} \left\|a_nz+\frac{a_s}{\binom{n}{s}}\right\|_{p}\leq \frac{\left\|z+\delta_{0s}\right\|_p}{\left\|1+z\right\|_p}\left\|P\right\|_{p}, \end{align*} where $\delta_{0s}$ is the Kronecker delta. In this paper, we consider the class of polynomials having no zero in $|z|<\rho,$ $\rho\geq 1$ and obtain some generalizations of above inequality., Comment: Polynomials; Visser's inequality; Inequalities in the complex domain

Let $P(z)$ be a polynomial of degree $n,$ then it is known that for $\alpha\in\mathbb{C}$ with $|\alpha|\leq \frac{n}{2},$ \begin{align*} \underset{|z|=1}{\max}|\left|zP^{\prime}(z)-\alpha P(z)\right|\leq \left|n-\alpha\right|\underset{|z|=1}{\max}|P(z)|. \end{align*} This inequality includes Bernstein's inequality, concerning the estimate for $|P^\prime(z)|$ over $|z|\leq 1,$ as a special case. In this paper, we extend this inequality to $L_p$ norm which among other things shows that the condition on $\alpha$ can be relaxed. We also prove similar inequalities for polynomials with restricted zeros., Comment: L^{p}$-inequalities, Bernstein's inequality, polynomials

Neural networks have emerged as powerful tools across various applications, yet their decision-making process often remains opaque, leading to them being perceived as "black boxes." This opacity raises concerns about their interpretability and reliability, especially in safety-critical scenarios. Network inversion techniques offer a solution by allowing us to peek inside these black boxes, revealing the features and patterns learned by the networks behind their decision-making processes and thereby provide valuable insights into how neural networks arrive at their conclusions, making them more interpretable and trustworthy. This paper presents a simple yet effective approach to network inversion using a meticulously conditioned generator that learns the data distribution in the input space of the trained neural network, enabling the reconstruction of inputs that would most likely lead to the desired outputs. To capture the diversity in the input space for a given output, instead of simply revealing the conditioning labels to the generator, we encode the conditioning label information into vectors and intermediate matrices and further minimize the cosine similarity between features of the generated images. Additionally, we incorporate feature orthogonality as a regularization term to boost image diversity which penalises the deviations of the Gram matrix of the features from the identity matrix, ensuring orthogonality and promoting distinct, non-redundant representations for each label. The paper concludes by exploring immediate applications of the proposed network inversion approach in interpretability, out-of-distribution detection, and training data reconstruction., Comment: arXiv admin note: substantial text overlap with arXiv:2410.16884, arXiv:2407.18002

We present a general framework for constructing solvable lattice models of chaotic many-body quantum dynamics with multiple unitary directions using biunitary connections. We show that a network of biunitary connections on the Kagome lattice naturally defines a multi-unitary circuit, where three `arrows of time' directly reflect the lattice symmetry. These models unify various constructions of hierarchical dual-unitary and triunitary gates and present new families of models with solvable correlations and entanglement dynamics. Using multilayer constructions of biunitary connections, we additionally introduce multilayer circuits with monoclinic symmetry and higher level hierarchical dual-unitary solvability and discuss their (non-)ergodicity. Our work demonstrates how different classes of solvable models can be understood as arising from different geometric structures in spacetime., Comment: 34 pages, 1 figure

In this second paper on the DECam deep drilling field (DDF) program we release 2,020 optical gri-band light curves for transients and variables in the extragalactic COSMOS and ELAIS fields based on time series observations with a 3-day cadence from semester 2021A through 2023A. In order to demonstrate the wide variety of time domain events detected by the program and encourage others to use the data set, we characterize the sample by presenting a brief analysis of the light curve parameters such as time span, amplitude, and peak brightness. We also present preliminary light curve categorizations, and identify potential stellar variables, active galactic nuclei, tidal disruption events, supernovae (such as Type Ia, Type IIP, superluminous, and gravitationally lensed supernovae), and fast transients. Where relevant, the number of identified transients is compared to the predictions of the original proposal. We also discuss the challenges of analyzing DDF data in the context of the upcoming Vera C. Rubin Observatory and its Legacy Survey of Space and Time, which will include DDFs. Images from the DECam DDF program are available without proprietary period and the light curves presented in this work are publicly available for analysis., Comment: 17 pages, 18 figures, 1 table; accepted for publication in MNRAS

Inferring spatial curvature of the Universe with high-fidelity is a longstanding interest in cosmology. However, the strong degeneracy between dark energy equation-of-state parameter $w$ and curvature density parameter $\Omega_{\rm K}$ has always been a hurdle for precision measurements of curvature from late-universe probes. With the imminent commissioning of Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST), we demonstrate for the first time, using simulations of stage-IV surveys, the crucial role of time-delay distances from strong gravitational lenses in breaking this degeneracy. Our findings suggest that in non-flat $ow$CDM model, while strong lensing data alone only yield a $\Omega_{\rm K}$ constraint at $\sim O(10^{-1})$ level, the integration with SNe Ia and BAO data breaks the $w$-$\Omega_{\rm K}$ degeneracy and refines the $\Omega_{\rm K}$ constraint to $\sim O(10^{-2})$. This surpasses the constraints typically derived from SNe Ia Hubble diagrams and BAO data and is comparable to the constraints obtained from \textit{Planck} Primary CMB data. Additionally, we present a non-parametric approach using Gaussian Process to avoid parameter-dependency of the expansion history $H(z)$ and achieve similar $O(10^{-2})$ level constraint on $\Omega_{\rm K}$. This study demonstrates the significant potential of strong gravitational lenses and Stage-IV surveys like LSST to achieve high-fidelity, independent constraints on $\Omega_{\rm K}$, contributing to our understanding of the Universe's geometry and the dynamics of dark energy., Comment: 7 pages, 4 figures. Accepted by MNRAS on 2024 November 6

Interpreting the cosmological constant as the energy of the vacuum and using a gravitational decoupling approach leads to a new Kerr--anti-de Sitter (AdS) black hole. The metric of the new Kerr--AdS is simpler than the standard Kerr--AdS and exhibits richer geometry, where the effects of rotation appear as warped curvature. We investigate the relationship between unstable photon orbits and thermodynamic phase transitions in this new Kerr--AdS black hole background. We derive an exact expression for various thermodynamic properties, including mass ($M$), Hawking temperature ($T$), entropy ($S$), heat capacity ($C$), and free energy ($G$), by relating the negative cosmological constant to positive pressure through the equation $P = -\Lambda/(8 \pi) = 3/(8 \pi l^2)$, where $l$ represents the horizon radius, and by introducing its conjugate variable as the thermodynamic volume $V$. When $P < P_c$, black holes with $C_P > 0$ are thermodynamically stable, while those with $C_P \leq 0$ are unstable. Our analysis of the Gibbs free energy reveals a phase transition from small, globally unstable black holes to large, globally stable ones. Additionally, investigating the system's $P$-$V$ criticality and determining the critical exponents shows that our system shares similarities with a Van der Waals (vdW) fluid. In the reduced parameter space, we observe non-monotonic behavior of the photon sphere radius and the critical impact parameter when the pressure is below its critical value. Furthermore, we present the distribution of critical points in parameter space and derive a fitting formula for the coexistence curve., Comment: 20 pages,13 figures, Published in Annals of Physics

Machine Learning models are often trained on proprietary and private data that cannot be shared, though the trained models themselves are distributed openly assuming that sharing model weights is privacy preserving, as training data is not expected to be inferred from the model weights. In this paper, we present Training-Like Data Reconstruction (TLDR), a network inversion-based approach to reconstruct training-like data from trained models. To begin with, we introduce a comprehensive network inversion technique that learns the input space corresponding to different classes in the classifier using a single conditioned generator. While inversion may typically return random and arbitrary input images for a given output label, we modify the inversion process to incentivize the generator to reconstruct training-like data by exploiting key properties of the classifier with respect to the training data along with some prior knowledge about the images. To validate our approach, we conduct empirical evaluations on multiple standard vision classification datasets, thereby highlighting the potential privacy risks involved in sharing machine learning models.

Traditional multi-agent path finding (MAPF) methods try to compute entire start-goal paths which are collision free. However, computing an entire path can take too long for MAPF systems where agents need to replan fast. Methods that address this typically employ a "windowed" approach and only try to find collision free paths for a small windowed timestep horizon. This adaptation comes at the cost of incompleteness; all current windowed approaches can become stuck in deadlock or livelock. Our main contribution is to introduce our framework, WinC-MAPF, for Windowed MAPF that enables completeness. Our framework uses heuristic update insights from single-agent real-time heuristic search algorithms as well as agent independence ideas from MAPF algorithms. We also develop Single-Step CBS (SS-CBS), an instantiation of this framework using a novel modification to CBS. We show how SS-CBS, which only plans a single step and updates heuristics, can effectively solve tough scenarios where existing windowed approaches fail.

Robots often face challenges in domestic environments where visual feedback is ineffective, such as retrieving objects obstructed by occlusions or finding a light switch in the dark. In these cases, utilizing contacts to localize the target object can be effective. We propose an online planning framework using binary contact signals for manipulation tasks with pose uncertainty, formulated as a Partially Observable Markov Decision Process (POMDP). Naively representing the belief as a particle set makes planning infeasible due to the large uncertainties in domestic settings, as identifying the best sequence of actions requires rolling out thousands of actions across millions of particles, taking significant compute time. To address this, we propose a hierarchical belief representation. Initially, we represent the uncertainty coarsely in a 3D volumetric space. Policies that refine uncertainty in this space are computed and executed, and once uncertainty is sufficiently reduced, the problem is translated back into the particle space for further refinement before task completion. We utilize a closed-loop planning and execution framework with a heuristic-search-based anytime solver that computes partial policies within a limited time budget. The performance of the framework is demonstrated both in real world and in simulation on the high-precision task of inserting a plug into a port using a UR10e manipulator, resolving positional uncertainties up to 50 centimeters and angular uncertainties close to $2\pi$. Experimental results highlight the framework's effectiveness, achieving a 93\% success rate in the real world and over 50\% improvement in solution quality compared to greedy baselines, significantly accelerating planning and enabling real-time solutions for complex problems., Comment: Under review (2025 IEEE International Conference on Robotics & Automation)

Relative distances between a high-redshift sample of Type Ia supernovae (SNe~Ia), anchored to a low-redshift sample, have been instrumental in drawing insights on the nature of the dark energy driving the accelerated expansion of the universe. A combination (hereafter called SBC) of the SNe~Ia with baryon acoustic oscillations (BAO) from the Dark Energy Spectroscopic Instrument (DESI) and the cosmic microwave background (CMB) recently indicated deviations from the standard interpretation of dark energy as a cosmological constant. In this paper, we analyse various systematic uncertainties in the distance measurement of SNe~Ia and their impact on the inferred dark energy properties in the canonical Chevallier-Polarski-Linder (CPL) model. We model systematic effects like photometric calibration, progenitor and dust evolution, and uncertainty in the galactic extinction law. We find that all the dominant systematic errors shift the dark energy inference towards the DESI 2024 results from an underlying $\Lambda$CDM cosmology. A small change in the calibration, and change in the Milky Way dust, can give rise to systematic-driven shifts on $w_0$-$w_a$ constraints, comparable to the deviation reported from the DESI 2024 results. We forecast that the systematic uncertainties can shift the inference of $w_0-w_a$ by a few times the error ellipse for future low- and high-$z$ SN~Ia compilations and hence, it is critical to circumvent them to robustly test for deviations from $\Lambda$. A slider and visualisation tool for quantifying the impact of systematic effects on the fitted cosmological parameters is publicly available at: https://github.com/sdhawan21/DEslider.git, Comment: 9 pages, 5 figures: see figure 3 for the axis of systematic bias. User interface tool to test the impact of systematic variation is available https://github.com/sdhawan21/DEslider.git

Strongly lensed supernovae (SNe) are a rare class of transient that can offer tight cosmological constraints that are complementary to methods from other astronomical events. We present a follow-up study of one recently-discovered strongly lensed SN, the quadruply-imaged Type Ia SN 2022qmx (aka, "SN Zwicky") at z = 0.3544. We measure updated, template-subtracted photometry for SN Zwicky and derive improved time delays and magnifications. This is possible because SNe are transient, fading away after reaching their peak brightness. Specifically, we measure point spread function (PSF) photometry for all four images of SN Zwicky in three Hubble Space Telescope WFC3/UVIS passbands (F475W, F625W, F814W) and one WFC3/IR passband (F160W), with template images taken $\sim 11$ months after the epoch in which the SN images appear. We find consistency to within $2\sigma$ between lens model predicted time delays ($\lesssim1$ day), and measured time delays with HST colors ($\lesssim2$ days), including the uncertainty from chromatic microlensing that may arise from stars in the lensing galaxy. The standardizable nature of SNe Ia allows us to estimate absolute magnifications for the four images, with images A and C being elevated in magnification compared to lens model predictions by about $6\sigma$ and $3\sigma$ respectively, confirming previous work. We show that millilensing or differential dust extinction is unable to explain these discrepancies and find evidence for the existence of microlensing in images A, C, and potentially D, that may contribute to the anomalous magnification., Comment: Submitted to ApJ

We introduce Playground v3 (PGv3), our latest text-to-image model that achieves state-of-the-art (SoTA) performance across multiple testing benchmarks, excels in graphic design abilities and introduces new capabilities. Unlike traditional text-to-image generative models that rely on pre-trained language models like T5 or CLIP text encoders, our approach fully integrates Large Language Models (LLMs) with a novel structure that leverages text conditions exclusively from a decoder-only LLM. Additionally, to enhance image captioning quality-we developed an in-house captioner, capable of generating captions with varying levels of detail, enriching the diversity of text structures. We also introduce a new benchmark CapsBench to evaluate detailed image captioning performance. Experimental results demonstrate that PGv3 excels in text prompt adherence, complex reasoning, and accurate text rendering. User preference studies indicate the super-human graphic design ability of our model for common design applications, such as stickers, posters, and logo designs. Furthermore, PGv3 introduces new capabilities, including precise RGB color control and robust multilingual understanding., Comment: Project page: https://playground.com/pg-v3

We study semidefinite relaxations of $\Pi_1$ combinatorial statements. By relaxing the pigeonhole principle, we obtain a new "quantum" pigeonhole principle which is a stronger statement. By relaxing statements of the form "the communication complexity of $f$ is $> k$", we obtain new communication models, which we call "$\gamma_2$ communication" and "quantum-lab protocols". We prove, via an argument from proof complexity, that any natural model obtained by such a relaxation must solve all Karchmer--Wigderson games efficiently. However, the argument is not constructive, so we work to explicitly construct such protocols in these two models.

We present the first homogeneous release of several thousand Type Ia supernovae (SNe Ia), all having spectroscopic classification, and spectroscopic redshifts for half the sample. This release, named the "DR2", contains 3628 nearby (z < 0.3) SNe Ia discovered, followed and classified by the Zwicky Transient Facility survey between March 2018 and December 2020. Of these, 3000 have good-to-excellent sampling and 2667 pass standard cosmology light-curve quality cuts. This release is thus the largest SN Ia release to date, increasing by an order of magnitude the number of well characterized low-redshift objects. With the "DR2", we also provide a volume-limited (z < 0.06) sample of nearly a thousand SNe Ia. With such a large, homogeneous and well controlled dataset, we are studying key current questions on SN cosmology, such as the linearity SNe Ia standardization, the SN and host dependencies, the diversity of the SN Ia population, and the accuracy of the current light-curve modeling. These, and more, are studied in detail in a series of articles associated with this release. Alongside the SN Ia parameters, we publish our force-photometry gri-band light curves, 5138 spectra, local and global host properties, observing logs, and a python tool to ease use and access of these data. The photometric accuracy of the "DR2" is not yet suited for cosmological parameter inference, which will follow as "DR2.5" release. We nonetheless demonstrate that the multi-thousand SN Ia Hubble Diagram has a typical 0.15 mag scatter., Comment: ZTF SN Ia DR2 release paper. Accepted for publication (Astronomy and Astrophysics). Reference paper for the ZTF SN Ia DR2 A&A Special Issue

The cores of stars are the cosmic furnaces where light elements are fused into heavier nuclei. The fusion of hydrogen to helium initially powers all stars. The ashes of the fusion reactions are then predicted to serve as fuel in a series of stages, eventually transforming massive stars into a structure of concentric shells. These are composed of natal hydrogen on the outside, and consecutively heavier compositions inside, predicted to be dominated by helium, carbon/oxygen, oxygen/neon/magnesium, and oxygen/silicon/sulphur. Silicon and sulphur are fused into inert iron, leading to the collapse of the core and either a supernova explosion or the direct formation of a black hole. Stripped stars, where the outer hydrogen layer has been removed and the internal He-rich layer (in Wolf-Rayet WN stars) or even the C/O layer below it (in Wolf-Rayet WC/WO stars) are exposed, provide evidence for this shell structure, and the cosmic element production mechanism it reflects. The types of supernova explosions that arise from stripped stars embedded in shells of circumstellar material (most notably Type Ibn supernovae from stars with outer He layers, and Type Icn supernovae from stars with outer C/O layers) confirm this scenario. However, direct evidence for the most interior shells, which are responsible for the production of elements heavier than oxygen, is lacking. Here, we report the discovery of the first-of-its-kind supernova arising from a star peculiarly stripped all the way to the silicon and sulphur-rich internal layer. Whereas the concentric shell structure of massive stars is not under debate, it is the first time that such a thick, massive silicon and sulphur-rich shell, expelled by the progenitor shortly before the SN explosion, has been directly revealed., Comment: 48 pages, 12 figures and 10 tables. Submitted to a high-impact journal. The reduced spectra and photometry will be made available via the journal webpage and the WISeREP archive after the acceptance of the paper

The non-Bloch topology leads to the emergence of various counter-intuitive phenomena in non-Hermitian systems under the open boundary condition (OBC), which can not find a counterpart in Hermitian systems. However, in the non-Hermitian system without chiral symmetry, being ubiquitous in nature, exploring its non-Bloch topology has so far eluded experimental effort. Here by introducing the concept of non-chiral non-Bloch invariants, we theoretically predict and experimentally identify the non-Bloch topological phase diagram of a one-dimensional (1D) non-Hermitian system without chiral symmetry in discrete-time non-unitary quantum walks of single photons. Interestingly, we find that such topological invariants not only can distinguish topologically distinct gapped phases, but also faithfully capture the corresponding gap closing in open-boundary spectrum at the phase boundary. Different topological regions are experimentally identified by measuring the featured discontinuities of the higher moments of the walker's displacement, which amazingly match excellently with our defined non-Bloch invariants. Our work provides a useful platform to study the interplay among topology, symmetries and the non-Hermiticity., Comment: 10 pages, 5 figures, including Supplementary Material

Neural networks have emerged as powerful tools across various applications, yet their decision-making process often remains opaque, leading to them being perceived as "black boxes." This opacity raises concerns about their interpretability and reliability, especially in safety-critical scenarios. Network inversion techniques offer a solution by allowing us to peek inside these black boxes, revealing the features and patterns learned by the networks behind their decision-making processes and thereby provide valuable insights into how neural networks arrive at their conclusions, making them more interpretable and trustworthy. This paper presents a simple yet effective approach to network inversion using a meticulously conditioned generator that learns the data distribution in the input space of the trained neural network, enabling the reconstruction of inputs that would most likely lead to the desired outputs. To capture the diversity in the input space for a given output, instead of simply revealing the conditioning labels to the generator, we encode the conditioning label information into vectors and intermediate matrices and further minimize the cosine similarity between features of the generated images.

Stochastic diffusion processes are pervasive in nature, from the seemingly erratic Brownian motion to the complex interactions of synaptically-coupled spiking neurons. Recently, drawing inspiration from Langevin dynamics, neuromorphic diffusion models were proposed and have become one of the major breakthroughs in the field of generative artificial intelligence. Unlike discriminative models that have been well developed to tackle classification or regression tasks, diffusion models as well as other generative models such as ChatGPT aim at creating content based upon contexts learned. However, the more complex algorithms of these models result in high computational costs using today's technologies, creating a bottleneck in their efficiency, and impeding further development. Here, we develop a spintronic voltage-controlled magnetoelectric memory hardware for the neuromorphic diffusion process. The in-memory computing capability of our spintronic devices goes beyond current Von Neumann architecture, where memory and computing units are separated. Together with the non-volatility of magnetic memory, we can achieve high-speed and low-cost computing, which is desirable for the increasing scale of generative models in the current era. We experimentally demonstrate that the hardware-based true random diffusion process can be implemented for image generation and achieve comparable image quality to software-based training as measured by the Frechet inception distance (FID) score, achieving ~10^3 better energy-per-bit-per-area over traditional hardware.

We propose and implement a novel test to assess deviations from well-established concordance $\Lambda$CDM cosmology while inferring dark energy properties. In contrast to the commonly implemented parametric forms of the dark energy equation-of-state (EoS), we test the validity of the cosmological constant on the more fundamental scale factor [$a(t)$] which determines the expansion rate of the Universe. We constrain our extended `general model' using the late-time observables. The posterior of the dark energy EoS is mainly constrained to be quintessence-like naturally excluding physically unviable regions such as phantom crossings or exponential growth., Comment: 8 Pages, 6 figures. Agrees with the published version (Dated:11/12/24). Comments are welcome

The speed-accuracy tradeoffs are prevalent in a wide range of physical systems. In this paper, we demonstrate speed-accuracy tradeoffs in the game of cricket, where 'batters' score runs on the balls bowled by the 'bowlers'. It is shown that the run scoring rate by a batter and the probability of dismissal follow a power-law relation. Due to availability of extensive data, game of cricket is an excellent model for the study of the effect of speed-accuracy tradeoff on the overall performance of the system. It is shown that the exponent of the power-law governs the nature of the adaptability of the player in different conditions and can be used for their assessment. Further, it is demonstrated that the players with extreme values of the power-law exponent are better suited for different playing conditions as compared to the ones with moderate values. These findings can be utilized to identify the potential of the cricket players for different game formats and can further help team management in devising strategies for the best outcomes with a given set of players., Comment: 6 pages, 3 figures

In manipulation tasks like plug insertion or assembly that have low tolerance to errors in pose estimation (errors of the order of 2mm can cause task failure), the utilization of touch/contact modality can aid in accurately localizing the object of interest. Motivated by this, in this work we model high-precision insertion tasks as planning problems under pose uncertainty, where we effectively utilize the occurrence of contacts (or the lack thereof) as observations to reduce uncertainty and reliably complete the task. We present a preprocessing-based planning framework for high-precision insertion in repetitive and time-critical settings, where the set of initial pose distributions (identified by a perception system) is finite. The finite set allows us to enumerate the possible planning problems that can be encountered online and preprocess a database of policies. Due to the computational complexity of constructing this database, we propose a general experience-based POMDP solver, E-RTDP-Bel, that uses the solutions of similar planning problems as experience to speed up planning queries and use it to efficiently construct the database. We show that the developed algorithm speeds up database creation by over a factor of 100, making the process computationally tractable. We demonstrate the effectiveness of the proposed framework in a real-world plug insertion task in the presence of port position uncertainty and a pipe assembly task in simulation in the presence of pipe pose uncertainty., Comment: \c{opyright} 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works

In response to the growing demand for precise and affordable solutions for Image-Guided Spine Surgery (IGSS), this paper presents a comprehensive development of a Robot-Assisted and Navigation-Guided IGSS System. The endeavor involves integrating cutting-edge technologies to attain the required surgical precision and limit user radiation exposure, thereby addressing the limitations of manual surgical methods. We propose an IGSS workflow and system architecture employing a hybrid-layered approach, combining modular and integrated system architectures in distinctive layers to develop an affordable system for seamless integration, scalability, and reconfigurability. We developed and integrated the system and extensively tested it on phantoms and cadavers. The proposed system's accuracy using navigation guidance is 1.02 0.34 mm, and robot assistance is 1.11 0.49 mm on phantoms. Observing a similar performance in cadaveric validation where 84% of screw placements were grade A, 10% were grade B using navigation guidance, 90% were grade A, and 10% were grade B using robot assistance as per the Gertzbein-Robbins scale, proving its efficacy for an IGSS. The evaluated performance is adequate for an IGSS and at par with the existing systems in literature and those commercially available. The user radiation is lower than in the literature, given that the system requires only an average of 3 C-Arm images per pedicle screw placement and verification., Comment: arXiv admin note: substantial text overlap with arXiv:2406.04644