arXiv subjects

Kai Wang

Publications and source records attributed to Kai Wang.

At least 379 records · Page 21Linked to original sources

arXiv2025

BPS invariants from framed links

In this article, we investigate the BPS invariants associated with framed links. We extend the relationship between the algebraic curve (i.e. dual $A$-polynomial) and the BPS invariants of a knot investigated in \cite{GKS} to the case of a framed knot. With the help of the framing change formula for the dual $A$-polynomial of a framed knot, we give several explicit formulas for the extremal $A$-polynomials and the BPS invariants of framed knots. As to the framed links, we present several numerical calculations for the Ooguri-Vafa invariants and BPS invariants for framed Whitehead links and Borromean rings and verify the integrality property for them.

math.GT↗

arXiv2025

Testing galaxy formation models with the stellar mass-halo mass relations for star-forming and quiescent galaxies

The tight relationship between the stellar mass and halo mass of galaxies is one of the most fundamental scaling relations in galaxy formation and evolution. It has become a critical constraint for galaxy formation models. Over the past decade, growing evidence has convincingly shown that the stellar mass-halo mass relations (SHMRs) for star-forming and quiescent central galaxies differ significantly: at a given stellar mass, the average host halo mass of quiescent centrals is more massive than that of the star-forming centrals. Despite the importance of this feature, its scientific implications have not yet been fully recognized or thoroughly explored in the field. In this work, we demonstrate that the semi-analytical model L-GALAXIES successfully reproduces these observational results, whereas three state-of-the-art hydrodynamic galaxy formation simulations (TNG, Illustris, and EAGLE) do not. Consequently, in L-GALAXIES, star-forming central galaxies are more efficient at converting baryons into stars than quiescent central galaxies at a given halo mass, while the other models predict similar efficiencies for both populations. Further analysis reveals that these fundamental discrepancies stem from distinct evolutionary paths on the stellar mass-halo mass plane. We show that the observed SHMRs for star-forming and quiescent galaxies support galaxy formation models in which quenching only weakly correlates with halo assembly histories, and in which the stellar mass of star-forming galaxies can increase significantly since cosmic noon. In contrast, models in which quenching strongly prefers to happen in early-formed halos are not very favored. Additionally, we find that galaxy downsizing is present in L-GALAXIES and TNG, but absent in Illustris and EAGLE.

astro-ph.GA↗

arXiv2025

What's in a Query: Polarity-Aware Distribution-Based Fair Ranking

Machine learning-driven rankings, where individuals (or items) are ranked in response to a query, mediate search exposure or attention in a variety of safety-critical settings. Thus, it is important to ensure that such rankings are fair. Under the goal of equal opportunity, attention allocated to an individual on a ranking interface should be proportional to their relevance across search queries. In this work, we examine amortized fair ranking -- where relevance and attention are cumulated over a sequence of user queries to make fair ranking more feasible in practice. Unlike prior methods that operate on expected amortized attention for each individual, we define new divergence-based measures for attention distribution-based fairness in ranking (DistFaiR), characterizing unfairness as the divergence between the distribution of attention and relevance corresponding to an individual over time. This allows us to propose new definitions of unfairness, which are more reliable at test time. Second, we prove that group fairness is upper-bounded by individual fairness under this definition for a useful class of divergence measures, and experimentally show that maximizing individual fairness through an integer linear programming-based optimization is often beneficial to group fairness. Lastly, we find that prior research in amortized fair ranking ignores critical information about queries, potentially leading to a fairwashing risk in practice by making rankings appear more fair than they actually are.

cs.LG↗

arXiv2025

Lumina-Video: Efficient and Flexible Video Generation with Multi-scale Next-DiT

Recent advancements have established Diffusion Transformers (DiTs) as a dominant framework in generative modeling. Building on this success, Lumina-Next achieves exceptional performance in the generation of photorealistic images with Next-DiT. However, its potential for video generation remains largely untapped, with significant challenges in modeling the spatiotemporal complexity inherent to video data. To address this, we introduce Lumina-Video, a framework that leverages the strengths of Next-DiT while introducing tailored solutions for video synthesis. Lumina-Video incorporates a Multi-scale Next-DiT architecture, which jointly learns multiple patchifications to enhance both efficiency and flexibility. By incorporating the motion score as an explicit condition, Lumina-Video also enables direct control of generated videos' dynamic degree. Combined with a progressive training scheme with increasingly higher resolution and FPS, and a multi-source training scheme with mixed natural and synthetic data, Lumina-Video achieves remarkable aesthetic quality and motion smoothness at high training and inference efficiency. We additionally propose Lumina-V2A, a video-to-audio model based on Next-DiT, to create synchronized sounds for generated videos. Codes are released at https://www.github.com/Alpha-VLLM/Lumina-Video.

cs.CV↗

arXiv2025

Recurrent Diffusion for Large-Scale Parameter Generation

Parameter generation has long struggled to match the scale of today large vision and language models, curbing its broader utility. In this paper, we introduce Recurrent Diffusion for Large Scale Parameter Generation (RPG), a novel framework that generates full neural network parameters up to hundreds of millions on a single GPU. Our approach first partitions a networks parameters into non-overlapping tokens, each corresponding to a distinct portion of the model. A recurrent mechanism then learns the inter token relationships, producing prototypes which serve as conditions for a diffusion process that ultimately synthesizes the full parameters. Across a spectrum of architectures and tasks including ResNets, ConvNeXts and ViTs on ImageNet 1K and COCO, and even LoRA based LLMs RPG achieves performance on par with fully trained networks while avoiding excessive memory overhead. Notably, it generalizes beyond its training set to generate valid parameters for previously unseen tasks, highlighting its flexibility in dynamic and open ended scenarios. By overcoming the longstanding memory and scalability barriers, RPG serves as a critical advance in AI generating AI, potentially enabling efficient weight generation at scales previously deemed infeasible.

cs.LG↗

arXiv2025

Assessing Open-world Forgetting in Generative Image Model Customization

Recent advances in diffusion models have significantly enhanced image generation capabilities. However, customizing these models with new classes often leads to unintended consequences that compromise their reliability. We introduce the concept of open-world forgetting to characterize the vast scope of these unintended alterations. Our work presents the first systematic investigation into open-world forgetting in diffusion models, focusing on semantic and appearance drift of representations. Using zero-shot classification, we demonstrate that even minor model adaptations can lead to significant semantic drift affecting areas far beyond newly introduced concepts, with accuracy drops of up to 60% on previously learned concepts. Our analysis of appearance drift reveals substantial changes in texture and color distributions of generated content. To address these issues, we propose a functional regularization strategy that effectively preserves original capabilities while accommodating new concepts. Through extensive experiments across multiple datasets and evaluation metrics, we demonstrate that our approach significantly reduces both semantic and appearance drift. Our study highlights the importance of considering open-world forgetting in future research on model customization and finetuning methods.

cs.CV↗

arXiv2025

One-Prompt-One-Story: Free-Lunch Consistent Text-to-Image Generation Using a Single Prompt

Text-to-image generation models can create high-quality images from input prompts. However, they struggle to support the consistent generation of identity-preserving requirements for storytelling. Existing approaches to this problem typically require extensive training in large datasets or additional modifications to the original model architectures. This limits their applicability across different domains and diverse diffusion model configurations. In this paper, we first observe the inherent capability of language models, coined context consistency, to comprehend identity through context with a single prompt. Drawing inspiration from the inherent context consistency, we propose a novel training-free method for consistent text-to-image (T2I) generation, termed "One-Prompt-One-Story" (1Prompt1Story). Our approach 1Prompt1Story concatenates all prompts into a single input for T2I diffusion models, initially preserving character identities. We then refine the generation process using two novel techniques: Singular-Value Reweighting and Identity-Preserving Cross-Attention, ensuring better alignment with the input description for each frame. In our experiments, we compare our method against various existing consistent T2I generation approaches to demonstrate its effectiveness through quantitative metrics and qualitative assessments. Code is available at https://github.com/byliutao/1Prompt1Story.

cs.CV↗

arXiv2025

Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy

Bipartite graphs, formed by two vertex layers, arise as a natural fit for modeling the relationships between two groups of entities. In bipartite graphs, common neighborhood computation between two vertices on the same vertex layer is a basic operator, which is easily solvable in general settings. However, it inevitably involves releasing the neighborhood information of vertices, posing a significant privacy risk for users in real-world applications. To protect edge privacy in bipartite graphs, in this paper, we study the problem of estimating the number of common neighbors of two vertices on the same layer under edge local differential privacy (edge LDP). The problem is challenging in the context of edge LDP since each vertex on the opposite layer of the query vertices can potentially be a common neighbor. To obtain efficient and accurate estimates, we propose a multiple-round framework that significantly reduces the candidate pool of common neighbors and enables the query vertices to construct unbiased estimators locally. Furthermore, we improve data utility by incorporating the estimators built from the neighbors of both query vertices and devise privacy budget allocation optimizations. These improve the estimator's robustness and consistency, particularly against query vertices with imbalanced degrees. Extensive experiments on 15 datasets validate the effectiveness and efficiency of our proposed techniques.

cs.DB↗

arXiv2025

SAMScore: A Content Structural Similarity Metric for Image Translation Evaluation

Image translation has wide applications, such as style transfer and modality conversion, usually aiming to generate images having both high degrees of realism and faithfulness. These problems remain difficult, especially when it is important to preserve content structures. Traditional image-level similarity metrics are of limited use, since the content structures of an image are high-level, and not strongly governed by pixel-wise faithfulness to an original image. To fill this gap, we introduce SAMScore, a generic content structural similarity metric for evaluating the faithfulness of image translation models. SAMScore is based on the recent high-performance Segment Anything Model (SAM), which allows content similarity comparisons with standout accuracy. We applied SAMScore on 19 image translation tasks, and found that it is able to outperform all other competitive metrics on all tasks. We envision that SAMScore will prove to be a valuable tool that will help to drive the vibrant field of image translation, by allowing for more precise evaluations of new and evolving translation models. The code is available at https://github.com/Kent0n-Li/SAMScore.

cs.CV↗

arXiv2025

From Halos to Galaxies. X: Decoding Galaxy SEDs with Physical Priors and Accurate Star Formation History Reconstruction

The spectral energy distribution (SED) of galaxies is essential for deriving fundamental properties like stellar mass and star formation history (SFH). However, conventional methods, including both parametric and non-parametric approaches, often fail to accurately recover the observed cosmic star formation rate (SFR) density due to oversimplified or unrealistic assumptions about SFH and their inability to account for the complex SFH variations across different galaxy populations. To address this issue, we introduce a novel approach that improves galaxy broadband SED analysis by incorporating physical priors derived from hydrodynamical simulations. Tests using IllustrisTNG simulations demonstrate that our method can reliably determine galaxy physical properties from broadband photometry, including stellar mass within 0.05 dex, current SFR within 0.3 dex, and fractional stellar formation time within 0.2 dex, with a negligible fraction of catastrophic failures. When applied to the Sloan Digital Sky Survey (SDSS) main photometric galaxy sample with spectroscopic redshift, our estimates of stellar mass and SFR are consistent with the widely used MPA-JHU and GSWLC catalogs. Notably, using the derived SFHs of individual SDSS galaxies, we estimate the cosmic SFR density and stellar mass density with remarkable consistency to direct observations up to $z \sim 6$. This demonstrates a significant advancement in deriving SFHs from SEDs that closely align with observational data. Consequently, our method can reliably recover observed spectral indices such as $\rm D_{\rm n}(4000)$ and $\rm Hδ_{\rm A}$ by synthesizing the full spectra of galaxies using the estimated SFHs and metal enrichment histories, relying solely on broadband photometry as input. Furthermore, this method is extremely computationally efficient compared to conventional approaches.

astro-ph.GA↗

arXiv2025

Ferroelectricity in undoped HfO2 down to one-unit-cell on Si substrate

Hafnium oxide (HfO2), particularly at low-dimensional scales, exhibits extensive promising applications in ultrahigh density devices like low-power logic and non-volatile memory devices due to its compatibility with current semiconductor technology1-5. However, achieving ferroelectricity (FE) at ultimate scale especially in undoped HfO2 remains challenging as the non-centrosymmetric FE phase, so-called O-III (space group: Pca21) is metastable and FE has a strong tendency of depolarization with the decrease in thickness6. Up to now, this phase has usually stabilized via doping with other elements7-9. But the minimum film thickness is still limited to 1 nm, about 2-unit-cell, to keep FE8. Thinner and undoped films, conducive to further miniature device size and avoid contamination during deposition process, have been a challenge to fabricate on Si substrates. Herein, we report the robust FE observed in undoped HfO2 ultrathin films directly grown on Si substrate via atomic layer deposition (ALD) and post-heat treat in vacuum. The so-fabricated ferroelectric O-III phase contains about 4.48 at% oxygen vacancy, is robust even monoclinic phase (space group: P21/c) coexists. The spontaneous and switchable polarization is remarkably stable, still surviving even in films down to 0.5 nm (one-unit-cell). Our results show the robust FE O-III phase can be obtained in films down to one-unit-cell in thickness on Si, providing a practical way to fabricating this important material in thickness limit.

cond-mat.mtrl-sci↗

arXiv2025

From Halos to Galaxies. VI. Improved halo mass estimation for SDSS groups and measurement of the halo mass function

In $Λ$CDM cosmology, galaxies form and evolve in their host dark matter (DM) halos. Halo mass is crucial for understanding the halo-galaxy connection. The abundance matching (AM) technique has been widely used to derive the halo masses of galaxy groups. However, quenching of the central galaxy can decouple the coevolution of its stellar mass and DM halo mass. Different halo assembly histories can also result in significantly different final stellar mass of the central galaxies. These processes can introduce substantial uncertainties in the halo masses derived from the AM method, particularly leading to a systematic bias between groups with star-forming centrals (blue groups) and passive centrals (red groups). To improve, we developed a new machine learning (ML) algorithm that accounts for these effects and is trained on simulations. Our results show that the ML method eliminates the systematic bias in the derived halo masses for blue and red groups and is, on average, $\sim1/3$ more accurate than the AM method. With careful calibration of observable quantities from simulations and observations from SDSS, we apply our ML model to the SDSS Yang et al. groups to derive their halo masses down to $10^{11.5}\mathrm{M_\odot}$ or even lower. The derived SDSS group halo mass function agrees well with the theoretical predictions, and the derived stellar-to-halo mass relations for both red and blue groups matches well with those obtained from direct weak lensing measurements. These new halo mass estimates enable more accurate investigation of the galaxy-halo connection and the role of the halos in galaxy evolution.

astro-ph.GA↗

arXiv2025

On Coordinated Drone-Courier Logistics for Intra-city Express Services

Problem definition: Drones, despite being acknowledged as a transformative force in the city logistics sector, are unable to execute the \textit{last-meter delivery} (unloading goods directly to customers' doorsteps) due to airspace restrictions and safety concerns. To leverage advancements and overcome the limitations of drones in providing intra-city express services, we introduce a coordinated drone-courier logistics system where drones operate within a closed network among vertiports, while couriers connect customers to the drone delivery system. This paper aims to shed light on this coordinated system in terms of system feasibility, network interactivity, and long-term sustainability. Methodology/Results: We develop an integrated optimization model to optimize the network planning of the coordinated logistics system. The interplay between network planning and tactical operations is mirrored by a queueing network model, resulting in the nonlinear and nonconvex (partially convex and partially concave) feasible region of the optimization model. An iterative exact algorithm that tightens lower and upper bounds by adaptively refining the linear approximations of nonlinear constraints is developed to provide optimality-guaranteed solutions with finite convergence. The computational experiments demonstrate the scalability and robustness of our algorithm across various network configurations and scenarios.Managerial implications: The case study, based on a real-world dataset from SF Express, a logistics giant in China, validates that the coordinated logistics system efficiently attains cost and time savings by leveraging the effective turnover of drones and the coordination between drones and couriers. The optimal network design features a concentrated structure, streamlining demand consolidation and reducing deadhead repositioning.

math.OC↗

arXiv2025

Detection of a new GeV source in the outer region of the Coma cluster: a signature of external accretion shock ?

The supersonic flow motions associated with infall of baryonic gas toward sheets and filaments, as well as cluster mergers, produces large-scale shock waves. The shocks associated with galaxy clusters can be classified mainly into two categories: internal shocks appear in the hot intracluster medium within the viral radius, and external accretion shocks form in the outer cold region well outside of the virial radius. Cosmic-ray (CR) electrons and/or protons accelerated by these shocks are expected to produce gamma-rays through inverse-Compton scatterings (ICS) or inelastic $pp$ collisions respectively. Recent studies have found a spatially extended GeV source within the virial radius, consistent with the internal shock origin. Here we report the detection of a new GeV source at a distance of about 2.8$^\circ$ from the center of the Coma cluster through the analysis of 16.2 years of Fermi-LAT data. The hard spectrum of the source, in agreement with the ICS origin, and its location in a large-scale filament of galaxies points to the external accretion shock origin. The gamma-ray ($0.1-10^3$ GeV) luminosity of the source, $1.4\times 10^{42}~ {\rm erg~s^{-1}}$, suggests that a fraction $\sim 10^{-3}$ of the kinetic energy flux through the shock-surface is transferred to relativistic CR electrons.

astro-ph.HE↗

arXiv2025

InpDiffusion: Image Inpainting Localization via Conditional Diffusion Models

As artificial intelligence advances rapidly, particularly with the advent of GANs and diffusion models, the accuracy of Image Inpainting Localization (IIL) has become increasingly challenging. Current IIL methods face two main challenges: a tendency towards overconfidence, leading to incorrect predictions; and difficulty in detecting subtle tampering boundaries in inpainted images. In response, we propose a new paradigm that treats IIL as a conditional mask generation task utilizing diffusion models. Our method, InpDiffusion, utilizes the denoising process enhanced by the integration of image semantic conditions to progressively refine predictions. During denoising, we employ edge conditions and introduce a novel edge supervision strategy to enhance the model's perception of edge details in inpainted objects. Balancing the diffusion model's stochastic sampling with edge supervision of tampered image regions mitigates the risk of incorrect predictions from overconfidence and prevents the loss of subtle boundaries that can result from overly stochastic processes. Furthermore, we propose an innovative Dual-stream Multi-scale Feature Extractor (DMFE) for extracting multi-scale features, enhancing feature representation by considering both semantic and edge conditions of the inpainted images. Extensive experiments across challenging datasets demonstrate that the InpDiffusion significantly outperforms existing state-of-the-art methods in IIL tasks, while also showcasing excellent generalization capabilities and robustness.

cs.CV↗

arXiv2025

On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing

Missing data imputation, which aims to impute the missing values in the raw datasets to achieve the completeness of datasets, is crucial for modern data-driven models like large language models (LLMs) and has attracted increasing interest over the past decades. Despite its importance, existing solutions for missing data imputation either 1) only support numerical and categorical data or 2) show an unsatisfactory performance due to their design prioritizing text data and the lack of key properties for tabular data imputation. In this paper, we propose UnIMP, a Unified IMPutation framework that leverages LLM and high-order message passing to enhance the imputation of mixed-type data including numerical, categorical, and text data. Specifically, we first introduce a cell-oriented hypergraph to model the table. We then propose BiHMP, an efficient Bidirectional High-order Message-Passing network to aggregate global-local information and high-order relationships on the constructed hypergraph while capturing the inter-column heterogeneity and intra-column homogeneity. To effectively and efficiently align the capacity of the LLM with the information aggregated by BiHMP, we introduce Xfusion, which, together with BiHMP, acts as adapters for the LLM. We follow a pre-training and fine-tuning pipeline to train UnIMP, integrating two optimizations: chunking technique, which divides tables into smaller chunks to enhance efficiency; and progressive masking technique, which gradually adapts the model to learn more complex data patterns. Both theoretical proofs and empirical experiments on 10 real world datasets highlight the superiority of UnIMP over existing techniques.

cs.LG↗

arXiv2024

Neural Network Diffusion

Diffusion models have achieved remarkable success in image and video generation. In this work, we demonstrate that diffusion models can also \textit{generate high-performing neural network parameters}. Our approach is simple, utilizing an autoencoder and a diffusion model. The autoencoder extracts latent representations of a subset of the trained neural network parameters. Next, a diffusion model is trained to synthesize these latent representations from random noise. This model then generates new representations, which are passed through the autoencoder's decoder to produce new subsets of high-performing network parameters. Across various architectures and datasets, our approach consistently generates models with comparable or improved performance over trained networks, with minimal additional cost. Notably, we empirically find that the generated models are not memorizing the trained ones. Our results encourage more exploration into the versatile use of diffusion models. Our code is available \href{https://github.com/NUS-HPC-AI-Lab/Neural-Network-Diffusion}{here}.

cs.LG↗

arXiv2024

Attosecond All-Optical Retrieval of Valley Polarization via Circular Dichroism in Transient Absorption

We propose a scheme for retrieving the ultrafast valley polarization (VP) dynamics in two-dimensional hexagonal materials via attosecond circular dichroism (CD) transient absorption spectroscopy. This approach builds on the CD transition between the first and higher conduction bands induced by the circularly polarized probe pulses. The population imbalance at nonequivalent valleys in the first conduction band is proportionally mapped onto the difference in absorption coefficients of two probe pulses with opposite helicities, supporting an unprecedented quantitative retrieval of the corresponding VP dynamics with subfemtosecond time resolution. We theoretically demonstrate the scheme for h-BN and MoS2 through ab initio calculations, achieving an accurate retrieval of the VP dynamics, particularly the transient VP switching processes, with a time resolution of 250 as.

physics.optics↗