SearcharxivSearch

arXiv subjects

Lei Huang

Publications and source records attributed to Lei Huang.

At least 19 recordsLinked to original sources

ConnectionMind: Leveraging Social Networks and Large Language Models for Personalized Recommendation at Meta

Modern recommendation systems on social media platforms such as Meta must model complex social relationships, including friendships, group memberships, and creator interactions, alongside massive and heterogeneous content such as text and video. Traditional recommendation models, however, often omit these signals or treat them independently, lacking the reasoning capability to integrate multi-relational context for fine-grained personalization. We present ConnectionMind, a production-ready recommendation framework that tightly integrates the social network structure with large language models (LLMs) to enable scalable, interpretable, and reasoning-aware personalization in Meta. ConnectionMind constructs a heterogeneous graph connecting users, items, friends, groups, and creator pages, and formulates recommendation as a graph reasoning problem: discovering personalized paths from users to candidate items. An LLM-based policy is employed to reason over these graph structures and guide recommendation decisions. To train the system at scale, ConnectionMind adopts a two-stage learning strategy. We first perform supervised fine-tuning (SFT) on large-scale user-item interaction trajectories to initialize the reasoning policy, followed by end-to-end reinforcement learning (RL) to refine the model's ability to reason over social graphs for personalized recommendation. Extensive experiments on multiple real-world datasets demonstrate the effectiveness of ConnectionMind compared to representative baselines. More importantly, ConnectionMind has been deployed in Meta's large-scale recommendation pipeline and has been evaluated through online A/B tests, achieving a 0.43% improvement in video watch time. These results demonstrate measurable real-world impact in a production recommendation system.

cs.IR

Joint Low-Dimensional Modeling and Sampling Design for Sparse On-Orbit Antenna Pattern Reconstruction

Accurately reconstructing satellite transmit-antenna patterns on orbit is difficult because only sparse directional measurements are available during normal mission operations. This paper develops a cooperative on-orbit pattern-reconstruction framework that converts received calibration power into normalized directional samples and represents the antenna power pattern using a truncated discrete cosine transform (DCT) basis. The resulting low-dimensional model transforms high-dimensional pattern recovery into coefficient estimation, for which a closed-form maximum-likelihood estimator and error characterization are derived. The analysis shows how DCT truncation error, measurement noise, and sampled-basis conditioning jointly affect reconstruction accuracy. For regularly accessible angular sectors, midpoint-uniform sampling provides an information-balanced baseline for the retained DCT modes. For constrained feasible opportunities, D-optimal sampling is used to select informative measurement directions. Simulations verify the accuracy of the angular discretization, the sample efficiency of the truncated-DCT model, and the reconstruction gain of D-optimal sampling under irregular orbit-generated opportunities.

eess.SP

GenSplatCodec: Feed-Forward Gaussian Splatting Compression via One-Step Diffusion

Feed-forward 3D Gaussian Splatting (3DGS) enables scalable scene reconstruction without per-scene optimization, yet produces dense Gaussians that are costly to store and transmit. Existing feed-forward Gaussian compression methods formulate decoding as deterministic representation recovery, which becomes inadequate at low bitrates when high-frequency textures and view-dependent appearance are discarded. Although generative models offer a promising alternative, using them as standalone post-processing decouples generation from the transmitted scene structure, thereby compromising cross-view consistency. To address these limitations, we propose GenSplatCodec, a unified feed-forward Gaussian codec that reformulates low-bitrate Gaussian compression as geometry-guided generative decoding. We present a detail-aware feed-forward Gaussian coding scheme within a dual-stream formulation, where the resulting compact Gaussian structural stream is complemented by a lightweight reference appearance stream. We further introduce a geometry-guided one-step generative decoding approach that jointly exploits decoded structural and appearance cues through hierarchical geometry control to reconstruct high-fidelity and view-consistent novel views. Finally, we develop a three-stage optimization strategy that stabilizes the learning of the unified codec and adapts the generative decoder to codec-derived structural and appearance cues. Extensive experiments across multiple datasets demonstrate that GenSplatCodec consistently achieves superior rate-distortion (RD) performance over existing methods.

cs.CV

VoLN: Vision-Only Long-Horizon Navigation---Paradigm, Benchmark, and Method

Vision-and-Language Navigation (VLN) enables embodied agents to follow natural-language instructions. However, route-level instructions commonly encode spatial priors, such as orientation, distance, and layout, that are not explicitly available from onboard sensing at deployment in open, GPS-denied environments. Benchmark performance under such interfaces therefore jointly reflects visual navigation ability and the use of route structure explicitly supplied by the task description. As a complementary formulation, we propose Vision-Only Long-Horizon Navigation (VoLN), which shifts route-relevant information from externally supplied instructions and global guidance to locally observable in-scene cues. In VoLN, goal views specify the destination, while route-relevant information is available only through locally observable in-scene cues that the agent must detect, interpret, and select online. We instantiate VoLN for aerial navigation through VoLN-UAV, a 7,210-episode benchmark that combines long-horizon goal-directed flight, continuous 3D motion, large viewpoint changes, and context-dependent beacon selection. We further provide VoLN-MLLM as an initial reference baseline. It aligns self-supervised visual features with a structured semantic space and predicts short-horizon waypoint segments from observation history, goal views, retrieved visual--semantic tokens, and proprioception. On the five-environment Test-Unseen split, it obtains success rates of 7.4%, 4.5%, and 1.8% on Easy, Normal, and Hard episodes, respectively. These results provide an initial evaluation of VoLN and reveal substantial remaining challenges in long-horizon evidence integration, cross-view goal matching, and closed-loop stability. Project page: https://admire-ljb.github.io/VoLN-UAV/

cs.RO

Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrieval

The two-tower model has been widely used for large-scale recommendation systems, particularly in the retrieval stage. Industry standards for training two-tower models typically involve in-batch and/or out-of-batch negative sampling. However, these methods often produce easy negatives that models can quickly learn, failing to sufficiently challenge the model. To address this issue, a novel self-supervised hard negative sampling technique is proposed that leverages a large language model (LLM) to generate hard negatives from the same cluster during model training. By utilizing the LLM to learn media representations, the proposed approach ensures that the generated negatives are more challenging and informative. This real-time sampling framework is designed for seamless integration into production models, capable of handling billions of training data points with minimal computational complexity. Experiments on public datasets, along with deployment to a large-scale online system, demonstrate that the proposed negative sampling technique outperforms widely used industry methods. Furthermore, analysis in industrial applications reveals that this sampling method can help break inherent feedback loops in recommendations and significantly reduce popularity bias.

cs.IR

MG-SpaIR: Multi-grade Sparse-guided Implicit Representation for Training-Data-Free Image Restoration

MG-SpaIR is a training-data-free framework for restoring a clean image from a single observation corrupted by a mixture of blur, downsampling, noise, and missing pixels. Building on implicit neural representations (INRs), we introduce a multi-grade coarse-to-fine residual hierarchy that progressively refines the reconstruction across resolution grades, improving representational fidelity and mitigating spectral limitations. To stabilize reconstruction optimization and suppress INR-induced artifacts, we further propose an explicit sparse proximal regularization (e.g., $\ell_0$-type) applied directly in the high-resolution image domain, which discourages spurious high-frequency patterns while preserving sharp structures. The resulting optimization is solved efficiently via a multi-grade proximal alternating scheme, and we establish convergence guarantees for the associated updates under standard regularity conditions. Experiments on mixed-degradation benchmarks demonstrate that MG-SpaIR consistently outperforms strong training-data-free baselines such as Deep Image Prior, providing a stable, interpretable, and data-efficient alternative to conventional learning-based restoration methods.

cs.CV

NEXT: Reasoning-Driven Video Recommendation via a Vision-Language Model

We present NEXT (Next-interest EXploration Transformer), a reasoning-driven video recommendation framework that reasons over the video a user has just watched, infers the viewer's next intent, and retrieves concrete follow-up videos. Explicit continuations such as episodes are linked directly; implicit cases are handled by generating intent queries and searching for matching candidates. This Item-to-Intent-to-Item formulation produces directed recommendations beyond co-engagement correlation or semantic similarity. To make this framework reliable at scale, we train NEXT-8B, a purpose-trained 8B vision-language model with a three-stage recipe: Perception-Enhanced Reinforcement Learning for query-agnostic evidence extraction, Distribution-Aligned Supervised Fine-Tuning over real and synthetic visual QA mixtures, and Group Relative Policy Optimization for last-mile alignment. NEXT-8B achieves the best single-model DocVQA performance, ranking second overall only behind a multi-agent system while surpassing a substantially larger 200B+ scale model, and improves next-intent logic-wise quality by 3.3% over the base model in a task-specific LLM-as-a-judge evaluation. We deploy NEXT as an additional retrieval path in a large-scale social media recommendation system and observe statistically significant production gains, including +0.53% watch time and +0.51% distinct video exposure. Overall, NEXT shows that a carefully trained compact vision-language model can serve as a practical reasoning engine for next-interest exploration at production scale.

cs.IR

Broadband multiwavelength properties of the archetypal blazar 3C 279 during the 2017 Event Horizon Telescope campaign

The archetypal blazar 3C 279 hosts a prominent relativistic jet and exhibits strong broadband variability across the electromagnetic spectrum. In April 2017, the Event Horizon Telescope (EHT) observed 3C 279, alongside one of the most extensive quasi-simultaneous multiwavelength (MWL) campaigns ever conducted. With the aim of investigating the physical processes governing 3C 279, we analyzed individual observations and multiband light curves, and constructed a new quasi-simultaneous MWL spectrum. We also performed phenomenological modeling using the turbulent extreme multi-zone (TEMZ) model to constrain the fundamental physical properties of the source. The EHT observations reveal a clear flux increase in the innermost core between April 5 and 11, 2017. Over a broader timescale, radio measurements at longer wavelengths show concurrent enhancements in core flux and polarization around mid-April, coinciding with the ejection of a superluminal knot. Record UV-optical flares with strong polarization variability occurred in late March, followed by gamma-ray activity that declined before the end of the EHT observing period. During this interval, the source remained in a low X-ray state and showed no detectable VHE emission. The TEMZ modeling suggests that the broadband spectrum and variability of 3C 279 can be explained within a jet scenario in which turbulent plasma cells are compressed by a stationary conical shock. However, alternative interpretations, such as magnetic reconnection or a moving shock-in-jet event, remain plausible. This coordinated MWL campaign advances our understanding of the origin of jet and gamma-ray emission in 3C 279, while also providing a comprehensive publicly available dataset that will serve as a valuable reference for future studies.

astro-ph.HE

Chiral Quantum Entanglement Transfer with Giant Atoms

We investigate entanglement transfer in a multi-giant-atom waveguide system. By tailoring chiral spontaneous emission and exploiting dark-state dynamics, the setup enables perfect, unidirectional sequential or selective transfer of quantum states and their associated entanglement. The distance between two entangled atoms, i.e., the entanglement length, can be dynamically adjusted, allowing robust conversion between long-range and short-range entanglement during propagation. The system inherently converges to a dark state, guaranteeing high-fidelity directional transfer. When the additional phase is modulated as a periodic piecewise function, spatially separated giant atoms exhibit stable, nearly lossless state exchange and maintain steady entanglement even under non-Markovian conditions. This behavior mimics conventional braided architectures without suffering from propagation delays or spatial restrictions. Our proposal offers a scalable pathway for continuous long-distance entanglement transport and resilient state exchange in quantum networks.

quant-ph

Network Recovery from Cascade Data: A Debiased Jacobian-Based Machine Learning Approach

Many important outcomes unfold as dynamic cascades, including product adoption, disease spread, financial distress, and information diffusion. A central challenge is to recover the hidden influence network behind these cascades. Existing methods typically assume a specific diffusion model, and their performance degrades substantially when that assumption is misspecified. We propose CascadeNet, a Jacobian-based machine learning framework for network recovery that does not require specifying a diffusion mechanism. The key idea is that the underlying influence structure can be characterized by the Jacobian of the one-step transition function. CascadeNet first constructs a flexible estimator of the transition function, and further applies Neyman-orthogonal debiasing via the Riesz representer, so that the debiased Jacobian is $\sqrt{n}$-consistent and asymptotically normal, enabling formal inference on the network structure. We validate CascadeNet in both a simulation exercise and a real-world empirical application. In simulations, where the data-generating process is known, CascadeNet achieves the highest network recovery accuracy across nine common data-generating processes. In an empirical application to COVID-19 transmission across Spain's 52 provinces, CascadeNet recovers transmission networks that are significantly correlated with the true inter-province mobility network, whereas networks recovered by baseline methods show no significant alignment with the ground truth.

cs.LG

Annotation-Informed Block-Sparse Bayesian Modeling for cis-Expression Prediction

Genotype-based cis-expression prediction depends on accurately modeling local regulatory architecture. We present block-sparse Bayesian sparse linear mixed model (bsBSLMM), an extension of Bayesian sparse linear mixed model (BSLMM) that incorporates linkage disequilibrium (LD)-block spike-and-slab sparsity and a transcription start site (TSS)-informed SNP inclusion prior. Across 23,098 genes from GEUVADIS European-ancestry lymphoblastoid cell lines, bsBSLMM retained more predictable genes than BSLMM, LASSO, BLUP, TIGAR elastic net, and TIGAR Dirichlet-process regression under matched evaluation criteria. Compared with BSLMM, bsBSLMM improved held-out prediction performance for most shared genes, with gains driven primarily by LD-block sparsity and further enhanced by the TSS-informed prior. Variants selected by bsBSLMM showed stronger enrichment in GM12878 DNase and H3K27ac regulatory regions than variants selected by BSLMM. In transcriptome-wide association study (TWAS) analysis, bsBSLMM recovered established inflammatory bowel disease signals, including IL23R, and identified additional genome-wide significant genes not detected by BSLMM. Independent validation in the Louisiana Osteoporosis Study reproduced the increased prediction yield across ancestries and recovered biologically relevant bone mineral density pathways in downstream TWAS and gene set enrichment analyses. These results demonstrate that incorporating LD-block structure and biologically informed SNP priors improves cis-expression prediction and enhances downstream TWAS discovery.

q-bio.GN

Scalable All-Optical Fibre-Mode Data Transmission with Profiles-Preserved Decoding

Optical fibres are the primary medium for optical signal transmission, and their guided modes provide a high-dimensional basis for modal-domain information encoding. However, conventional demultiplexing approaches typically convert fibre modes into fundamental Gaussian modes and require repeated mode conversions, while existing profiles-preserved methods are generally restricted to fewer than three modes. High-quality fibre-mode data transmission therefore requires a scalable all-optical decoder capable of separating strongly overlapping modal channels while preserving their intrinsic spatial profiles. Here, we establish a scalable profiles-preserved all-optical decoding method for high-dimensional fibre-mode data transmission. By introducing a microlens-array-assisted decoding architecture with channel-dependent spherical phase compensation, the proposed method accommodates mode-dependent effective focal-length variations, enabling scalable modal-channel separation while preserving high-quality modal profiles at the output plane. Experimentally, the optical decoder resolved fields containing eight fibre modes, achieving a mode fidelity exceeding 0.72, a worst-channel crosstalk of $-5.57~\mathrm{dB}$ and a mean non-target crosstalk of $-21.34~\mathrm{dB}$, while reconstructing the relative modal weights with an error below 0.1. Semantic transmission experiments using digits and Chinese characters further demonstrated effective recovery of the encoded information from the decoded modal signals. We expect this work to provide a scalable route towards high-dimensional all-optical fibre-mode data transmission.

physics.optics

Existence and Counting Bounds for High-Memory Spatially-Coupled Codes via the Combinatorial Nullstellensatz

The finite-length performance of spatially-coupled low-density parity-check (SC-LDPC) codes is strongly affected by short cycle configurations and the harmful structures induced by them. This paper studies SC-LDPC code design directly at the protograph level, where the design variables are the edge-spreading assignments specified by the partition matrix. In contrast to CLLL/Moser--Tardos based constructive frameworks for QC-SC-LDPC codes, we focus on sharper nonconstructive existence and counting bounds. By encoding cycle-activation conditions as polynomial vanishing constraints over finite grids, we apply the Combinatorial Nullstellensatz to derive sufficient memory conditions for eliminating prescribed cycle-induced harmful structures. For fully connected $(\gamma,\kappa)$ base graphs, the resulting bounds explicitly characterize the memory required to destroy all $4$-cycles as well as all $4$- and $6$-cycles, and for fixed $\gamma$, they are asymptotically tight up to a constant factor compared with known lower bounds. We further apply the Alon--F\"uredi theorem to obtain lower bounds on the number of feasible edge-spreading assignments, including an explicit counting bound for assignments that eliminate all $4$-cycles and hence yield girth at least six. These results provide a refined algebraic-combinatorial characterization of the feasible design space for high-memory SC-LDPC codes, although no corresponding construction algorithm is provided.

cs.IT

Agentic Recommender System with Hierarchical Belief-State Memory

Memory-augmented LLM agents have advanced personalized recommendation, yet existing approaches universally adopt flat memory representations that conflate ephemeral signals with stable preferences, and none provides a complete lifecycle governing how memory should evolve. We propose MARS (Memory-Augmented Agentic Recommender System), a framework that treats recommendation as a partially observable problem and maintains a structured belief state that progressively abstracts noisy behavioral observations into a compact estimate of user preferences. MARS organizes this belief state into three tiers: event memory buffers raw signals, preference memory maintains fine-grained mutable chunks with explicit strength and evidence tracking, and profile memory distills all preferences into a coherent natural language narrative. A complete lifecycle of six operations -- extraction, reinforcement, weakening, consolidation, forgetting, and resynthesis -- is adaptively scheduled by an LLM-based planner rather than fixed-interval heuristics. Experiments on four InstructRec benchmark domains show that MARS achieves state-of-the-art performance with average improvements of 26.4% in HR@1 and 10.3% in NDCG@10 over the strongest baselines with further gains from agentic scheduling in evolving settings.

cs.CL

Enjoy Your Layer Normalization with the Computational Efficiency of RMSNorm

Layer normalization (LN) is a fundamental component in modern deep learning, but its per-sample centering and scaling introduce non-negligible inference overhead. RMSNorm improves efficiency by removing the centering operation, yet this may discard benefits associated with centering. This paper propose a framework to determine whether an LN in an arbitrary DNN can be replaced by RMSNorm without changing the model function. The key idea is to fold LN's centering operation into upstream general linear layers by enforcing zero-mean outputs through the column-centered constraint (CCC) and column-based weight centering (CBWC). We extend the analysis to arbitrary DNNs, define such LNs as foldable LNs, and develop a graph-based detection algorithm. Our analysis shows that many LNs in widely used architectures are foldable, enabling exact inference-time conversion and end-to-end acceleration of 2% to 12% without changing model predictions. Experiments across multiple task families further show that, when exact equivalence is partially broken in practical training settings, our method remains competitive with vanilla LN while improving efficiency.

cs.LG

Anti-Self-Distillation for Reasoning RL via Pointwise Mutual Information

On-policy self-distillation, where a student is pulled toward a copy of itself conditioned on privileged context (e.g., a verified solution or feedback), offers a promising direction for advancing reasoning capability without a stronger external teacher. Yet in math reasoning the gains are inconsistent, even when the same approach succeeds elsewhere. A pointwise mutual information analysis traces the failure to the privileged context itself: it inflates the teacher's confidence on tokens already implied by the solution (structural connectives, verifiable claims) and deflates it on deliberation tokens ("Wait", "Let", "Maybe") that drive multi-step search. We propose Anti-Self-Distillation (AntiSD), which ascends a divergence between student and teacher rather than descending it: this reverses the per-token sign and yields a naturally bounded advantage in one step. An entropy-triggered gate disables the term once the teacher entropy collapses, completing a drop-in replacement for default self-distillation. Across five models from 4B to 30B parameters on math reasoning benchmarks, AntiSD reaches the GRPO baseline's accuracy in 2 to 10x fewer training steps and improves final accuracy by up to 11.5 points. AntiSD opens a path to scalable self-improvement, where a language model bootstraps its own reasoning through its training signal.

cs.LG

From Generic Correlation to Input-Specific Credit in On-Policy Self Distillation

On-policy self-distillation has emerged as a promising paradigm for post-training language models, in which the model conditions on environment feedback to serve as its own teacher, providing dense token-level rewards without external teacher models or step-level annotations. Despite its empirical success, what this reward actually measures and what kind of credit it assigns remain unclear. Under a posterior-compatibility interpretation of feedback conditioning, standard in the implicit-reward literature, we show that the self-distillation token reward is a Bayesian filtering increment whose trajectory sum is exactly the pointwise mutual information between the response and the feedback given the input. This pMI can be raised by input-specific reasoning or by input-generic shortcuts, so we further decompose the teacher log-probability along the input axis. Based on this analysis, we propose CREDIT (Contrastive REward from DIsTillation), which isolates the input-specific component with a batch-contrastive baseline. At the sequence level, CREDIT is a teacher-side surrogate for a contrastive pMI objective that also penalizes responses remaining likely under unrelated inputs. Across coding, scientific reasoning, and tool-use benchmarks on two model families, CREDIT delivers the strongest aggregate performance at negligible additional compute.

cs.LG

From Large Telescopes to the MUltiplexed Survey Telescope (MUST)

Recent advances in astronomical observations have ushered in an era of remarkable discoveries. We now probe the Universe through multi-messenger signals, image the sky with unprecedented depth and resolution, and investigate individual sources using powerful large-aperture telescopes. Yet, a critical gap persists: the lack of wide-field, highly multiplexed spectroscopic capabilities needed to fully exploit the wealth of imaging data from current and upcoming surveys. In this review, we trace the historical development of large optical telescopes and spectroscopic surveys, assess the capabilities of ongoing and near-future facilities, and motivate the need for next-generation Stage-V spectroscopic experiments. As a representative example, we present the MUltiplexed Survey Telescope (MUST), the first Stage-V spectroscopic facility currently under construction. MUST is a 6.5-meter telescope designed to obtain optical spectra for over 20,000 targets simultaneously within a $\sim$5 deg$^2$ field, using a modular focal plane populated with 6.2-mm pitch fiber-positioning robots. Over an 8-year survey in the 2030s, MUST aims to build the most comprehensive 3D spectroscopic map of the Universe to date, measuring redshifts for over 100 million galaxies and quasars and opening new windows into cosmology, Galactic structure, and time-domain astrophysics.

astro-ph.IM