Searcharxiv⌕ Search

arXiv subjects

Ziwei Li

Publications and source records attributed to Ziwei Li.

At least 55 records · Page 3Linked to original sources

FA-INR: Adaptive Implicit Neural Representations for Interpretable Exploration of Simulation Ensembles

Surrogate models are essential for efficient exploration of large-scale ensemble simulations. Implicit neural representations (INRs) provide a compact and continuous framework for modeling spatially structured data, but they often struggle with learning complex localized structures within the scientific fields. Recent INR-based surrogates address this by augmenting INRs with explicit feature structures, but at the cost of flexibility and substantial memory overhead. In this paper, we present Feature-Adaptive INR (FA-INR), an adaptive INR-based surrogate model for high-fidelity and interpretable exploration of ensemble simulations. Instead of relying on structured feature representations, FA-INR leverages cross-attention over a learnable key-value memory bank to allocate model capacity adaptively based on the data characteristics. To further improve scalability, we introduce a coordinate-guided mixture of experts (MoE) framework that enhances both efficiency and specialization of feature representations. More importantly, the learned experts produce an interpretable partition over the simulation domain, enabling scientists to identify complex structures and perform localized parameter-space exploration. Beyond quantitative and qualitative evaluations, we also demonstrate that our learned expert specialization can reveal meaningful scientific insights and support localized sensitivity analysis.

cs.LG↗

Matrix-Weighted Poincaré-Type Inequalities with Applications to Logarithmic Hajłasz--Besov Spaces on Spaces of Homogeneous Type

Let ${\mathcal {X}}$ be a space of homogeneous type. In this article, based on the reducing operators of matrix $A_p$-weights, the authors introduce the vector-valued Hajłasz gradient sequences and establish some related matrix-weighted Poincaré-type inequalities on ${\mathcal {X}}$. As an application, the authors introduce the matrix-weighted logarithmic Besov spaces on ${\mathcal {X}}$ and establish their pointwise characterization via Hajłasz gradient sequences. The novelty of this article lies in that, by means of both the $A_p$ dimension and its properties of matrix $A_p$-weights and the wavelet reproducing formula with exponential decay of P. Auscher and T. Hytönen, all the main results get rid of the dependence on the reverse doubling conditions of both weights and ${\mathcal {X}}$ under consideration and these results are also completely new even for unweighted logarithmic Besov spaces on ${\mathcal {X}}$.

math.FA↗

Factorization-in-Loop: Proximal Fill-in Minimization for Sparse Matrix Reordering

Fill-ins are new nonzero elements in the summation of the upper and lower triangular factors generated during LU factorization. For large sparse matrices, they will increase the memory usage and computational time, and be reduced through proper row or column arrangement, namely matrix reordering. Finding a row or column permutation with the minimal fill-ins is NP-hard, and surrogate objectives are designed to derive fill-in reduction permutations or learn a reordering function. However, there is no theoretical guarantee between the golden criterion and these surrogate objectives. Here we propose to learn a reordering network by minimizing \(l_1\) norm of triangular factors of the reordered matrix to approximate the exact number of fill-ins. The reordering network utilizes a graph encoder to predict row or column node scores. For inference, it is easy and fast to derive the permutation from sorting algorithms for matrices. For gradient based optimization, there is a large gap between the predicted node scores and resultant triangular factors in the optimization objective. To bridge the gap, we first design two reparameterization techniques to obtain the permutation matrix from node scores. The matrix is reordered by multiplying the permutation matrix. Then we introduce the factorization process into the objective function to arrive at target triangular factors. The overall objective function is optimized with the alternating direction method of multipliers and proximal gradient descent. Experimental results on benchmark sparse matrix collection SuiteSparse show the fill-in number and LU factorization time reduction of our proposed method is 20% and 17.8% compared with state-of-the-art baselines.

cs.LG↗

Nonlinear Dirac equations on noncompact quantum graphs with potentials: Multiplicity and Concentration

In this paper, we study the existence and multiplicity of solutions to the following class of nonlinear Dirac equations (NLDE) on noncompact quantum graphs: \[ -i\,\varepsilon c\,σ_1\,\partial_x u + m c^2 σ_3 u + V(x)\,u = f(|u|)\,u, \quad x\in \mathcal{G}, \tag{P} \] where \(V:\mathcal{G}\to\mathbb{R}\) and \(f:\mathbb{R}\to\mathbb{R}\) are continuous, \(\varepsilon>0\) is a semiclassical parameter, \(m>0\) denotes the mass, and \(c>0\) the speed of light. Here \(σ_1,σ_3\) are Pauli matrices, and \(\mathcal{G}\) is a noncompact quantum graph. We prove that when \(\varepsilon\) is sufficiently small, the number of solutions to \((P)\) is at least the number of global minima of \(V\). Moreover, these solutions exhibit semiclassical concentration: as \(\varepsilon\to0\), their concentration points approach the set of global minima of \(V\).

math.AP↗

SN 2024aecx: A double-peaked rapidly evolving Type IIb supernova at 11 Mpc

We present the results of low-resolution spectroscopic and densely sampled multi-band photometric follow-up of supernova (SN) 2024aecx. The SN was discovered in the spiral galaxy NGC 3521 (distance $\sim$11 Mpc) within a day after the explosion. The early spectra of SN 2024aecx show a weak signature of hydrogen lines, which disappeared in $\sim$30 days after the explosion. Light curves in all bands show a distinct feature of two peaks, and the first peak is likely due to the shock cooling emission. The early phase light curve evolution of SN 2024aecx has similarity with the typical Type IIb events, but the decay rate in different bands (e.g., $\rm Δm_{15}$ = 1.60 $\pm$ 0.05 mag, $g$-band) is significantly faster in the post-peak phase. It attained the secondary maximum in $\sim$19 days ($g$-band) with a peak absolute magnitude of M$_{g}$ = -17.94 $\pm$ 0.10 mag. SN 2024aecx colors trend redder in early epochs ($<$8 days), followed by a duration in which it grows bluer, then later gets redder again $>$20 days after explosion. The analytical model fitting to the light curves reveals an envelope mass and progenitor radii in the range of $\sim$0.03 - 0.24 $M_\odot$ and $\sim$169 - 200 $R_\odot$, respectively. Modeling of the pseudo-bolometric light curve suggests that synthesized $^{56}$Ni in the explosion was $\sim$0.15 M$_{\odot}$ with ejecta mass and kinetic energy of $\sim$0.7 M$_{\odot}$ and $\sim$0.16 $\times$ 10$^{51}$ erg, respectively. The observational properties and modeling indicate that the SN~2024aecx progenitor belongs to the extended progenitor category.

astro-ph.HE↗

RedMaPPer Cluster Properties from Two-Dimensional Lensing Shear Maps in the HSC-SSP Survey

Dark matter halos are fundamental cosmological structures whose properties-such as concentration, ellipticity, and mass centroid-encode information about their formation and evolution. Concentration traces collapse time and internal structure, while ellipticity and centroid offsets reflect halo shape and dynamical state. Accurate characterization of these properties improves mass estimates and tests dark matter models. Gravitational lensing, which directly probes projected mass distributions, provides a powerful means to constrain halo structure. We present a 2D weak-lensing analysis of 299 RedMaPPer clusters using shear measurements from the HSC-SSP first-year data release. By fitting elliptical NFW models with mass priors from the RedMaPPer cluster richness-mass relation, considering the priors helps us break the mass-concentration degeneracy and tighten constraints on other parameters. The derived concentration-mass relation exhibits a slightly steeper slope than traditional weak-lensing power-law or upturn models, and agrees more closely with the results from strong lensing selected halos. More massive and lower-redshift clusters tend to have lower concentrations and appear more spherical. The halo ellipticity distribution is characterized by e=1-b/a=0.530+/-0.168, with a mean of =0.505+/-0.007. We also detect a bimodal distribution in the offsets between optical centers and mass centroids: some halos are well-aligned with their brightest cluster galaxy (BCG), while others show significant displacements. These results highlight the power of 2D weak-lensing modeling in probing halo morphology and in providing key inputs for understanding and modeling systematic effects in stacked lensing analyses.

astro-ph.CO↗

GBR: Generative Bundle Refinement for High-fidelity Gaussian Splatting with Enhanced Mesh Reconstruction

Gaussian splatting has gained attention for its efficient representation and rendering of 3D scenes using continuous Gaussian primitives. However, it struggles with sparse-view inputs due to limited geometric and photometric information, causing ambiguities in depth, shape, and texture. we propose GBR: Generative Bundle Refinement, a method for high-fidelity Gaussian splatting and meshing using only 4-6 input views. GBR integrates a neural bundle adjustment module to enhance geometry accuracy and a generative depth refinement module to improve geometry fidelity. More specifically, the neural bundle adjustment module integrates a foundation network to produce initial 3D point maps and point matches from unposed images, followed by bundle adjustment optimization to improve multiview consistency and point cloud accuracy. The generative depth refinement module employs a diffusion-based strategy to enhance geometric details and fidelity while preserving the scale. Finally, for Gaussian splatting optimization, we propose a multimodal loss function incorporating depth and normal consistency, geometric regularization, and pseudo-view supervision, providing robust guidance under sparse-view conditions. Experiments on widely used datasets show that GBR significantly outperforms existing methods under sparse-view inputs. Additionally, GBR demonstrates the ability to reconstruct and render large-scale real-world scenes, such as the Pavilion of Prince Teng and the Great Wall, with remarkable details using only 6 views.

cs.CV↗

Spectral Hardening Reveals Afterglow Emergence in Long-Duration Fast X-ray Transients: A Case Study of GRB 250404A/EP250404a

The prompt emission and afterglow phases of gamma-ray bursts (GRBs) have been extensively studied, yet the transition between these two phases remains inadequately characterized due to limited multiwavelength observational coverage. Among the recent growing samples of fast X-ray transients observed by Einstein Probe (EP), a subgroup of GRBs are captured with long-duration X-ray emission, potentially containing featured evolution from prompt emission to the afterglow phase. In this Letter, we present a detailed analysis of GRB 250404A/EP250404a, a bright fast X-ray transient detected simultaneously by EP and the Fermi Gamma-ray Burst Monitor in X-rays and gamma rays. Its continuous X-ray emission reveals a long-duration tail, accompanied by distinct spectral evolution manifested by the spectral index $α_{\rm X}$ with an initial softening, followed by an evident hardening, eventually reaching a plateau at the value of $\sim$ -2. Early optical and near-infrared observations enable broadband modeling with forward- and reverse-shock components, confirming that the X-ray hardening signals the emergence of the external-shock afterglow. From this spectral hardening we infer that the prompt phase in soft X-rays lasted $\sim300\;\mathrm{s}$, which is more than 3 times longer than the gamma-ray $T_{90}$. This well-tracked soft-hard-flat spectral pattern provides a clear indication of afterglow emergence from the fading prompt emission and offers a practical criterion for identifying a distinct population of GRBs among fast X-ray transients, even when the detection of the gamma-ray counterpart or obvious temporal break is absent.

astro-ph.HE↗

SaviorRec: Semantic-Behavior Alignment for Cold-Start Recommendation

In recommendation systems, predicting Click-Through Rate (CTR) is crucial for accurately matching users with items. To improve recommendation performance for cold-start and long-tail items, recent studies focus on leveraging item multimodal features to model users' interests. However, obtaining multimodal representations for items relies on complex pre-trained encoders, which incurs unacceptable computation cost to train jointly with downstream ranking models. Therefore, it is important to maintain alignment between semantic and behavior space in a lightweight way. To address these challenges, we propose a Semantic-Behavior Alignment for Cold-start Recommendation framework, which mainly focuses on utilizing multimodal representations that align with the user behavior space to predict CTR. First, we leverage domain-specific knowledge to train a multimodal encoder to generate behavior-aware semantic representations. Second, we use residual quantized semantic ID to dynamically bridge the gap between multimodal representations and the ranking model, facilitating the continuous semantic-behavior alignment. We conduct our offline and online experiments on the Taobao, one of the world's largest e-commerce platforms, and have achieved an increase of 0.83% in offline AUC, 13.21% clicks increase and 13.44% orders increase in the online A/B test, emphasizing the efficacy of our method.

cs.IR↗

Modeling the impacts of galaxy intrinsic alignments on weak lensing peak statistics

Weak gravitational lensing (WL) peak statistics capture cosmic non-linear structures and can provide additional cosmological information complementary to cosmic shear two-point correlation analyses. They have been applied to different WL surveys successfully. To further facilitate their high precision applications, it is very timely to investigate the impacts of different systematics on WL peak statistics and how to mitigate them. Concerning the influence from galaxy intrinsic alignments (IAs), in this paper, we develop a theoretical model for WL high peaks taking into account the IA effects. It is an extension of our previous halo-based model. The IA corrections mainly include the modification of the lensing profile of clusters of galaxies due to the alignments of satellite galaxies and the additional shape noise correlations. We validate our model using simulations with the semi-analytical galaxy formation. We consider the cases where the satellite galaxies are averagely radially aligned toward the centers of their host clusters but with different dispersions $σ_θ$. We show that our model works well for $σ_θ>45^{\circ}$. If the IA corrections are not included in the model, for the Euclid/CSST-like source galaxy distribution and the survey area of $\sim 1000 deg^2$, the IA induced bias on $S_8$ can reach $\sim 8σ$ even for $σ_θ=75^{\circ}$. With our model, not only the bias can be well mitigated, but also we can constrain the satellite IA to the level of {\bf $σ(σ_θ)\sim \pm 24^{\circ}$} simultaneously from WL high peak analyses alone using data from such a survey.

astro-ph.CO↗

DV365: Extremely Long User History Modeling at Instagram

Long user history is highly valuable signal for recommendation systems, but effectively incorporating it often comes with high cost in terms of data center power consumption and GPU. In this work, we chose offline embedding over end-to-end sequence length optimization methods to enable extremely long user sequence modeling as a cost-effective solution, and propose a new user embedding learning strategy, multi-slicing and summarization, that generates highly generalizable user representation of user's long-term stable interest. History length we encoded in this embedding is up to 70,000 and on average 40,000. This embedding, named as DV365, is proven highly incremental on top of advanced attentive user sequence models deployed in Instagram. Produced by a single upstream foundational model, it is launched in 15 different models across Instagram and Threads with significant impact, and has been production battle-proven for >1 year since our first launch.

cs.IR↗

SolPhishHunter: Towards Detecting and Understanding Phishing on Solana

Solana is a rapidly evolving blockchain platform that has attracted an increasing number of users. However, this growth has also drawn the attention of malicious actors, with some phishers extending their reach into the Solana ecosystem. Unlike platforms such as Ethereum, Solana has distinct designs of accounts and transactions, leading to the emergence of new types of phishing transactions that we term SolPhish. We define three types of SolPhish and develop a detection tool called SolPhishHunter. Utilizing SolPhishHunter, we detect a total of 8,058 instances of SolPhish and conduct an empirical analysis of these detected cases. Our analysis explores the distribution and impact of SolPhish, the characteristics of the phishers, and the relationships among phishing gangs. Particularly, the detected SolPhish transactions have resulted in nearly \$1.1 million in losses for victims. We report our detection results to the community and construct SolPhishDataset, the \emph{first} Solana phishing-related dataset in academia.

cs.CR↗

Seamless Optical Cloud Computing across Edge-Metro Network for Generative AI

The rapid advancement of generative artificial intelligence (AI) in recent years has profoundly reshaped modern lifestyles, necessitating a revolutionary architecture to support the growing demands for computational power. Cloud computing has become the driving force behind this transformation. However, it consumes significant power and faces computation security risks due to the reliance on extensive data centers and servers in the cloud. Reducing power consumption while enhancing computational scale remains persistent challenges in cloud computing. Here, we propose and experimentally demonstrate an optical cloud computing system that can be seamlessly deployed across edge-metro network. By modulating inputs and models into light, a wide range of edge nodes can directly access the optical computing center via the edge-metro network. The experimental validations show an energy efficiency of 118.6 mW/TOPs (tera operations per second), reducing energy consumption by two orders of magnitude compared to traditional electronic-based cloud computing solutions. Furthermore, it is experimentally validated that this architecture can perform various complex generative AI models through parallel computing to achieve image generation tasks.

cs.DC↗

NSFlow: An End-to-End FPGA Framework with Scalable Dataflow Architecture for Neuro-Symbolic AI

Neuro-Symbolic AI (NSAI) is an emerging paradigm that integrates neural networks with symbolic reasoning to enhance the transparency, reasoning capabilities, and data efficiency of AI systems. Recent NSAI systems have gained traction due to their exceptional performance in reasoning tasks and human-AI collaborative scenarios. Despite these algorithmic advancements, executing NSAI tasks on existing hardware (e.g., CPUs, GPUs, TPUs) remains challenging, due to their heterogeneous computing kernels, high memory intensity, and unique memory access patterns. Moreover, current NSAI algorithms exhibit significant variation in operation types and scales, making them incompatible with existing ML accelerators. These challenges highlight the need for a versatile and flexible acceleration framework tailored to NSAI workloads. In this paper, we propose NSFlow, an FPGA-based acceleration framework designed to achieve high efficiency, scalability, and versatility across NSAI systems. NSFlow features a design architecture generator that identifies workload data dependencies and creates optimized dataflow architectures, as well as a reconfigurable array with flexible compute units, re-organizable memory, and mixed-precision capabilities. Evaluating across NSAI workloads, NSFlow achieves 31x speedup over Jetson TX2, more than 2x over GPU, 8x speedup over TPU-like systolic array, and more than 3x over Xilinx DPU. NSFlow also demonstrates enhanced scalability, with only 4x runtime increase when symbolic workloads scale by 150x. To the best of our knowledge, NSFlow is the first framework to enable real-time generalizable NSAI algorithms acceleration, demonstrating a promising solution for next-generation cognitive systems.

cs.AR↗

Exploring cosmological constraints of the weak gravitational lensing and galaxy clustering joint analysis in the CSST photometric survey

We explore the joint weak lensing and galaxy clustering analysis from the photometric survey operated by the China Space Station Telescope (CSST), and study the strength of the cosmological constraints. We employ a high-resolution JiuTian-1G simulation to construct a partial-sky light cone to $z=3$ covering 100 deg$^2$, and obtain the CSST galaxy mock samples based on an improved semi-analytical model. We perform a multi-lens-plane algorithm to generate corresponding synthetic weak lensing maps and catalogs. Then we generate the mock data based on these catalogs considering the instrumental and observational effects of the CSST, and use the Markov Chain Monte Carlo (MCMC) method to perform the constraints. The covariance matrix includes non-Gaussian contributions and super-sample covariance terms, and the systematics from intrinsic alignments, galaxy bias, photometric redshift uncertainties, shear calibration, and non-linear effects are considered in the analysis. We find that the constraint result is comparable to that from Stage III surveys, and it can be significantly improved further in the full CSST survey with 17500 deg$^2$. This indicates the CSST photometric survey is powerful for exploring the Universe.

astro-ph.CO↗

Neural Approaches to SAT Solving: Design Choices and Interpretability

In this contribution, we provide a comprehensive evaluation of graph neural networks applied to Boolean satisfiability problems, accompanied by an intuitive explanation of the mechanisms enabling the model to generalize to different instances. We introduce several training improvements, particularly a novel closest assignment supervision method that dynamically adapts to the model's current state, significantly enhancing performance on problems with larger solution spaces. Our experiments demonstrate the suitability of variable-clause graph representations with recurrent neural network updates, which achieve good accuracy on SAT assignment prediction while reducing computational demands. We extend the base graph neural network into a diffusion model that facilitates incremental sampling and can be effectively combined with classical techniques like unit propagation. Through analysis of embedding space patterns and optimization trajectories, we show how these networks implicitly perform a process very similar to continuous relaxations of MaxSAT, offering an interpretable view of their reasoning process. This understanding guides our design choices and explains the ability of recurrent architectures to scale effectively at inference time beyond their training distribution, which we demonstrate with test-time scaling experiments.

cs.LG↗

Edge-guided inverse design of digital metamaterial-based mode multiplexers for high-capacity multi-dimensional interconnect

The escalating demands of compute-intensive applications urgently necessitate the adoption of optical interconnect technologies to overcome bottlenecks in scaling computing systems. This requires fully exploiting the inherent parallelism of light across scalable dimensions for data loading. Here we experimentally demonstrate a synergy of wavelength- and mode- multiplexing combined with high-order modulation formats to achieve multi-tens-of-terabits-per-second optical interconnects using foundry-compatible silicon photonic circuits. Implementing an edge-guided analog-and-digital optimization method that integrates high efficiency with fabrication robustness, we achieve the inverse design of mode multiplexers based on digital metamaterial waveguides. Furthermore, we employ a packaged five-mode multiplexing chip, achieving a single-wavelength interconnect capacity of 1.62 Tbit s-1 and a record-setting multi-dimensional interconnect capacity of 38.2 Tbit s-1 across 5 modes and 88 wavelength channels, with high-order formats up to 8-ary pulse-amplitude-modulation (PAM). This study highlights the transformative potential of optical interconnect technologies to surmount the constraints of electronic links, thus setting the stage for next-generation datacenter and optical compute interconnects.

physics.optics↗

FedNE: Surrogate-Assisted Federated Neighbor Embedding for Dimensionality Reduction

Federated learning (FL) has rapidly evolved as a promising paradigm that enables collaborative model training across distributed participants without exchanging their local data. Despite its broad applications in fields such as computer vision, graph learning, and natural language processing, the development of a data projection model that can be effectively used to visualize data in the context of FL is crucial yet remains heavily under-explored. Neighbor embedding (NE) is an essential technique for visualizing complex high-dimensional data, but collaboratively learning a joint NE model is difficult. The key challenge lies in the objective function, as effective visualization algorithms like NE require computing loss functions among pairs of data. In this paper, we introduce \textsc{FedNE}, a novel approach that integrates the \textsc{FedAvg} framework with the contrastive NE technique, without any requirements of shareable data. To address the lack of inter-client repulsion which is crucial for the alignment in the global embedding space, we develop a surrogate loss function that each client learns and shares with each other. Additionally, we propose a data-mixing strategy to augment the local data, aiming to relax the problems of invisible neighbors and false neighbors constructed by the local $k$NN graphs. We conduct comprehensive experiments on both synthetic and real-world datasets. The results demonstrate that our \textsc{FedNE} can effectively preserve the neighborhood data structures and enhance the alignment in the global embedding space compared to several baseline methods.

cs.LG↗