Searcharxiv⌕ Search

arXiv subjects

Yangyang Li

Publications and source records attributed to Yangyang Li.

At least 19 recordsLinked to original sources

No complete set of mutually unbiased bases in dimension ten contains the Fourier pair or three product bases

With computer-assisted proofs that $\mathbb{C}^6$ admits at most three mutually unbiased bases (MUBs) now available, $\mathbb{C}^{10}$ is the smallest dimension in which it is unknown whether a complete set of $d+1=11$ MUBs exists; only three MUBs are known. We prove that every triple of mutually unbiased product bases of $\mathbb{C}^2\otimes\mathbb{C}^5$ is strongly unextendible: no vector is unbiased to all three bases. Consequently no set of four MUBs in dimension ten, and in particular no complete set, contains three product bases. This settles the case $d=2\times5$ anticipated by McNulty, Pammer and Weigert; it was known only for the Heisenberg-Weyl triple. The proof covers all ten equivalence classes with explicit Nullstellensatz certificates modulo one prime on $91$ charts of $\mathbb{P}^9\times\mathbb{P}^9$ for each class ($910$ in all), transferred to characteristic zero by a projective reduction lemma, together with an independent rank certificate for eight of the ten classes. We also prove that the pair formed by the standard and the Fourier basis of $\mathbb{C}^{10}$ is contained in no set of four MUBs. Exactly $3040$ rays are unbiased to both bases (this confirms the count found numerically by Führ and Rzeszotnik), each of them is unbiased to at most eight of the others, and every triple formed by the pair and a third MUB is strongly unextendible. For this we certify $34,940$ cyclic $10$-roots in Krawczyk uniqueness boxes, decide unimodularity exactly through an involution, and prove completeness by a four-dimensional interval branch-and-bound obtained from the Chinese-remainder splitting $\mathbb{Z}_{10}=\mathbb{Z}_2\times\mathbb{Z}_5$.

quant-ph↗

No complete set of mutually unbiased bases in C^6 without Fourier vanishing

A recent exact certificate shows that C^6 admits no seven mutually unbiased bases, hence at most five (OpenAI, 2026). That argument has two parts. The first proves the Fourier-vanishing conjecture of Matolcsi, Ruzsa and Weiner for every complex Hadamard matrix of order six other than Tao's cubic matrix, and excludes the cubic matrix separately. The second feeds this vanishing into a positivity certificate on mixed moments of a hypothetical complete family. We show that the first part is not needed. We keep the same six families of test functions and the same linear identities, but we never set a moment to zero because of Fourier vanishing. New positive definite integer matrices still give the contradiction. The only inputs are orthonormality, unbiasedness, the second-moment (2-design) identity of a complete family, and the trivial bound |moment| <= 1. A standard-library program checks the certificate in exact integer and rational arithmetic in under a minute and a half. We also record computational observations that are not part of the proof: a systematic S_6-symmetric family of test functions appears to close the argument with relations of total order at most 7 instead of 11, and at order 9 two orbit types of test charges appear to suffice. In the prime-power dimensions 4,5,7,8, where complete families exist, the same pipeline finds no certificate, as it must.

quant-ph↗

Observing minimal submanifolds with isolated singularities on open sets of metrics

We develop a perturbative theory for minimal submanifolds with only (strongly) isolated singularities, with respect to varying background Riemannian metrics. As an application, we obtain a general "sporadic persistence" criterion, thus naturally complementing the non-persistence theorem by the authors. In particular, such a criterion is satisfied by the spherical suspension in $\mathbb{S}^{3m+2}$ of the Veronese embedding of $\mathbb{K}\mathbb{P}^2$ for $\mathbb{K}=\mathbb{R},\mathbb{C},\mathbb{H},\mathbb{O}$ (the normed division algebras) in the round spheres of dimension $3m+1=4,7,13,25$ respectively, thereby providing families of continuously varying $(2m+1)$-dimensional stationary varifolds with isolated singularities that are observable on an open set of metrics. By our previous results, these phenomena cannot possibly occur in the codimension one scenario.

math.DG↗

Latent Residual Reasoning for Ranking in Generative Recommendation

Generative recommendation (GR) models for ranking typically adopt a fast-thinking direct prediction paradigm with strong practical efficiency. However, ranking requires fine-grained scoring across multiple candidate items, while existing GR models still mainly rely on one-shot prediction. This raises the question whether additional inference-time computation can further improve ranking quality. Recently, inspired by Chain-of-Thought (CoT) reasoning in large language models (LLMs), some work has begun to introduce reasoning into recommendation systems. Some of these methods rely on LLM reasoning frameworks to perform explicit reasoning in textual space, but such designs are not suitable for more widely deployed non-textual recommendation models. A more relevant direction is to introduce latent reasoning into ID-based recommendation models. Although recent work has extended latent reasoning to industrial ranking, how successive reasoning steps should improve fine-grained candidate scores remains less explored. To address this problem, we propose Refiner, a latent residual reasoning framework with parameter-efficient fine-tuning for generative ranking. Our approach introduces three key components: (1) a residual reasoning mechanism that progressively refines ranking scores through cumulative additive corrections, (2) history queries that provide condensed user behavior representations to enhance candidate-specific reasoning, and (3) a parameter-efficient fine-tuning strategy that leverages LoRA modules to adapt pre-trained models for latent reasoning. Extensive experiments on two public benchmarks, an offline industrial dataset, and an online A/B test demonstrate that Refiner consistently improves over direct prediction, validating its effectiveness and practical utility.

cs.IR↗

Morse index characterization of the Veronese projective plane

Following Simons' seminal work in 1968, every closed, connected, embedded minimal surface in the four-sphere that is not totally geodesic has Morse index at least five. In this paper, we prove that equality holds if and only if the surface is congruent to the Veronese projective plane. Relying on recent advances by Bernstein and Ketover, this characterization settles Kusner's 1996 conjecture on the minimizers of the Willmore functional in dimension four for surfaces whose normal bundle has nonzero Euler number. This is always the case, in particular, for embeddings of nonorientable surfaces whose orientation double cover has even genus.

math.DG↗

The $R$-Process Alliance: On J0010$-$1735, an Accreted, Chemically Unusual, Metal-poor Star with $R$-process Enhancement

We present a detailed chemo-dynamical analysis of the chemically peculiar very metal-poor ([Fe/H]$=-2.22\pm 0.11$) Milky Way (MW) halo star, 2MASS J00101758$-$1735387 (hereafter J0010-1735), discovered by the $R$-Process Alliance. We derive abundances for 45 elements, including 28 neutron-capture elements, and confirm that \thestar\ is highly $r$-process-enhanced, with [Eu/Fe]=$+1.30$. The light, $α$, and Fe-peak element abundances ratios relative to Fe are all sub-solar, aside from C, Si, and most extremely, Ca. We investigate three possible formation scenarios based on the star's chemical abundances and orbital kinematics: whether it formed in the \textit{in-situ} MW halo, in a MW dwarf galaxy satellite, or in a satellite of the Magellanic Cloud system. Using the position of \thestar\ in the [Mg/Mn]--[Al/Fe] plane, the abundance pattern of both the light and heavy elements, and the kinematics, we conclude that J0010-1735 most plausibly originated in a now-disrupted ultra-faint dwarf galaxy that was accreted into the MW halo. We examine potential chemical enrichment scenarios of J0010-1735, including one similar to the $r$-process-enhanced UFD Reticulum II, or enrichment via a sub-Chandrasekhar Type Ia SNe, potentially supplemented by a Ca-rich gap transient and by a separate neutron-rich site that facilitated $r$-process enrichment. A nuclear cosmochronometric age of $12.5\pm4.2$ Gyr is derived from the [Th/Eu] ratio, consistent with an ancient origin in one of the earliest star-forming systems in the universe.

astro-ph.SR↗

A Memory-Magic Exchange Law in Streaming Clifford+T Compilation

A phase that reaches a fault-tolerant processor in additive pieces can be remembered until the last piece arrives, or executed on arrival: the first option costs classical memory carried across rounds, the second costs magic states committed before the phase is known. We determine the exchange rate $α$, committed $T$ gates per bit of memory forgone, for ancilla-free coordinatewise Clifford+$T$ compilation. The Ramanujan bound gives $α\ge2$ with explicit constants, the square-root barrier of the spectral method. An elementary determinant method, using that quaternion numerators lie on spheres in both real embeddings of $\mathbb{Q}(\sqrt2)$, counts words near any rotation coset below that barrier. With a height dichotomy for the sphere sections it produces and a fibration over rational projections, it gives every $α<5/2$ unconditionally and uniformly over frames, by an exact SMT check of its continuum case analysis; $5/2$ is where this method stops. At Clifford-framed cosets the volume law holds up to subexponential factors: all but a vanishing fraction of $z$-rotations need $T$-count $(3-o(1))\log_2(1/\varepsilon)$, and processes whose committed pieces are near Clifford-framed $z$-rotations, including per-rotation pipelines, have $α\ge3-o(1)$, which a fractional-passthrough family attains under the Ross-Selinger typical-cost hypothesis. Under an equidistribution conjecture supported by exhaustive enumeration to $T$-count 22, $α=3$ in general and memory should be shed in whole rotations. The bounds hold even when the phases cancel to the identity; side information enters through a conditional entropy; probabilistic mixing halves the costs but not the rate. With clean ancillas and a phase-gradient catalyst, table lookups batched over coordinates drive the rate to $O(1/\log\log(1/\varepsilon))$, so the constant-rate law is specific to coordinatewise synthesis.

quant-ph↗

Representation-Dependent Recoverability in Quantum Compilation

Fault-tolerant compilation can disperse high-level structure: schedules split an accumulated phase across rounds, gate synthesis replaces an angle by a Clifford+$T$ word, and randomized compiling spreads rotations over sign-randomized fragments. They preserve the computation but change how cheaply a downstream compiler can recover the aggregate phase data. We formalize this representation-dependent recoverability by charging two channels: output committed before the suffix arrives, and a serialized restart state crossing the cut. For an $r$-round accumulation of a commuting layer with $m$ generators at accuracy $ε$ ($K_ε=Θ(1/ε)$), any $p$-pass compiler correct on every valid stream with failure probability at most $δ$ obeys $\overline{A}_p+(2p-1)S\geq(1-δ)m\log_2 K_ε-h_2(δ)$, where $\overline{A}_p$ is committed output and $S$ is the crossing-state cap. The bound covers compile-time randomized compiling; a memory-capped block compiler attains it within a constant factor, and direct semantic aggregation reaches compact output with logarithmic state. The two channels are not always interchangeable. A compiler whose committed prefix is executed at the cut pays a toll the state channel never pays: the entropy $\log_2\binom{m}{k}$ of the mask naming which $k$ coordinates it commits early. Compilers that defer or buffer pay none of it. We prove both directions and, with instrumented compilers under a preregistered protocol, measure a per-generator toll matching $\log_2\binom{m}{k}/k$ that vanishes for a public mask and a buffered control. Under a disclosed fixed-total-error Clifford+$T$ and surface-code model, a materialize-first pipeline costs orders of magnitude more logical $T$ states and spacetime volume than a semantic-first one. Phase semantics should therefore be preserved until aggregation whenever the interface permits.

quant-ph↗

Scalable Subgraph Sampling via Resistance Curvature

Subgraph sampling reduces the training cost of large-scale graph neural networks, but sampling criteria may overlook the geometric roles of edges. We propose a resistance-curvature-guided sampling framework built on ERC-LG, a curvature approximation method for large-scale graphs. ERC-LG combines Johnson-Lindenstrauss projections with regularized multi-GPU batched conjugate gradient solvers, avoiding explicit Laplacian pseudoinverse computation and full embedding storage. The resulting curvature informs node- and edge-sampling probabilities for constructing GNN training subgraphs. Experiments show numerical agreement with pseudoinverse-based curvature and reduced runtime compared with CG-only computation. ERC-LG-based sampling variants achieve the highest mean accuracy on six of seven real-world datasets in downstream node classification.

cs.LG↗

Geometric Flow enhanced Graph Coarsening

Recently, researchers have proposed a graph pooling operation, akin to the pooling process in conventional convolutional neural networks (CNN), aimed at reducing the computation cost of Graph convolutional neural networks (GCNNs). While most GCNN-based methods treat graph pooling as a node clustering problem and propose learning a cluster assignment matrix, existing clustering-based pooling methods tend to focus solely on the rough topology information of graphs, neglecting the exploitation of higher-order mutual connections among neighbors. In terms of message passing on graph, the ease of information passing on edges reflects the closeness between neighboring nodes, which significantly relies on the interconnectivity among neighbors. In this study, we address this gap by considering such local connection information and introducing a novel graph pooling method named RicciPool. We introduce discrete graph curvature, particularly Ollivier-Ricci curvature, as a measure of higher-order connectivity around an edge. Subsequently, we construct an Ollivier-Ricci flow formula to reweigh edge weights, leveraging the crucial information provided by Ricci curvature, particularly vital for extracting clusters in graphs. Building upon this foundation, we utilize the spectral clustering technique to learn a new cluster assignment matrix. Experimental results on multiple bioinformatics protein datasets and social networks underscore the effectiveness of our proposed method.

cs.AI↗

Synergising Local Geo-Environmental Characteristics with Spatial Context for Enhancing Landslide Susceptibility Mapping

Data-driven methods are widely used in landslide susceptibility mapping (LSM) because they can effectively model the complex relationships between landslides and geo-environmental conditions. Existing data-driven approaches generally follow two types of data representations. Pixel-based models focus solely on the geo-environmental characteristics of a specific landslide but neglect the influence of its surrounding environment. Patch-based models incorporate surrounding spatial context but may include pixels with weak or no spatial relevance to the target landslide location. To address this limitation, this study proposes a Local-Geo and Spatial Context Fusion (LGSCF) strategy, which synergises the geo-environmental characteristics of landslide points with their corresponding spatial context through a feature-wise modulation mechanism. We tested the LGSCF strategy by integrating it into several representative convolutional neural network (CNN) architectures, creating nine different LGSCF-based models. The primary study area covers approximately 2644 km2 across Jenai and Sinyi Townships in Nantou County, Taiwan, and the dataset comprises 5332 landslide samples and an equal number of non-landslide samples. The results show that LGSCF-based models consistently outperform their corresponding baselines, achieving F1-scores up to 87.09% and AUC values up to 0.9472. Furthermore, the susceptibility maps produced by LGSCF-based models show that known landslides are more accurately concentrated in "very high" susceptibility zones with fewer misclassifications. These findings demonstrate that our fusion strategy can significantly improve the accuracy of landslide susceptibility mapping.

cs.CV↗

Breaking User-Centric Agency: A Tri-Party Framework for Agent-Based Recommendation

Large language models (LLMs) have spurred interest in agent-based recommender systems, yet most agentic approaches remain user-centric: items stay passive entities whose exposure is a by-product of relevance ranking, which exacerbates exposure concentration and long-tail under-representation. We break this user-centric allocation of agency with a Tri-party LLM-agent Recommendation framework (TriRec). Responsibility is split deliberately: Stage 1 has each item generate self-promotion conditioned on the target user, which lowers cold-start barriers, while the exposure budget stays with the platform, whose Stage 2 sequential re-ranker balances relevance, item utility, and exposure fairness. On four public datasets TriRec improves accuracy, fairness, and item-level utility, with the accuracy gain significant on three of the four. A three-arm ablation at 50 candidates separates two levels of the mechanism on items that received no exposure during training: self-promotion drives the accuracy gain, and conditioning it on the target user adds further exposure, together raising these items' share of top-ranked exposure by 43.6% relative. Restricting promotions to catalogue-verifiable attributes cuts strong exaggeration to 0.5%/2.0% on two datasets while retaining 88.6%/92.0% of the accuracy gain. Our code is available at https://github.com/Marfekey/TriRec.

cs.IR↗

From Empathy to Personalized Empathy: Adapting Empathetic Strategies to Individual Users

As Large Language Models (LLMs) are increasingly deployed in long-term interactions with users, empathy has become an increasingly important capability. However, existing research overlooks the influence of users' personality traits on empathetic strategies during long-term interactions. To address this gap, we introduce the task of personalized empathy, which focuses on adapting empathetic strategies according to users' personalized characteristics derived from history. To study and enhance this capability, we construct PersonaEmp, a personalized empathy dataset built from long-term user-AI interactions, featuring rich user histories, persona information, and empathy-seeking queries. We further propose PereGRM, a reward modeling framework that combines the empathy evaluation structure with dynamic evaluation criteria generation for fine-grained reward modeling. Experimental results across different settings and multiple judge models show that PereGRM consistently achieves the strongest performance improvements, indicating its effectiveness for enhancing personalized empathetic capabilities.

cs.CL↗

Min-max theory and minimal surfaces with prescribed genus

We establish a general min-max type theorem that produces minimal surfaces with prescribed genus in 3-manifolds with positive Ricci curvature. An important intermediate step is to show that, in a generic metric with positive Ricci curvature, any family of surfaces with possibly finitely many singularities can be deformed into a certain topologically optimal family. Results in this paper will be crucial to our program on the construction of multiple minimal surfaces with prescribed genus in 3-spheres via topological methods.

math.DG↗

RECAP: Feedback-Driven Streaming Semantic User Profiles for Short-Video Recommendation

Language-based user profiles convert long behavioral histories into explicit semantic representations for recommendation. However, most profile generators are optimized in an open loop: they may summarize past behavior fluently, but are not directly trained to improve future recommendation. We study this problem in real-world short-video recommendation, where user behaviors continuously arrive as streams and profiles must be incrementally updated under limited capacity. This requires maintaining a consistent bounded profile state and constructing profile-targeted semantic feedback from industrial implicit behavior logs. We propose RECAP, an offline closed-loop framework for optimizing streaming structured semantic profiles with historical recommendation feedback. RECAP maintains each profile as a bounded structured memory by combining LLM-based semantic updates with deterministic lifecycle and capacity control. RECAP constructs profile-targeted semantic feedback by filtering label-consistent behavior pairs with an LLM judge and training a dual-tower evaluator whose matching score serves as a GRPO reward. Experiments on Kuaishou short-video data show that RECAP improves uAUC by 0.0084 and Recall@2000 by about 4.9% over the base generator. Further analyses confirm the benefits of feedback construction and policy optimization, and show more grounded refinement and user-level abstraction in profile updates. A seven-day online A/B test further shows a statistically significant 0.139% improvement in average application usage time per user.

cs.IR↗

Enhancing Photometric Redshift Estimation for LSST with a Hybrid LSTM-Mixture Density Network

Accurate photometric redshift (photo-$z$) estimation and robust uncertainty quantification are essential for the LSST to achieve its precision cosmology goals. Traditional machine learning algorithms are largely restricted to point estimates, struggling to characterize the multimodal nature of redshift PDFs and the degeneracies within the color-redshift space. To address this, we present and validate the LSTM-MDNz architecture, which integrates sequential feature extraction with flexible probability density modeling to enhance both prediction accuracy and uncertainty calibration across a broad redshift range, thereby meeting the stringent data quality requirements necessitated by next-generation cosmological analysis. The LSTM-MDNz framework treats multi-band photometry as wavelength-ordered sequences, utilizing LSTM networks to capture non-linear evolutionary correlations across the SED. A Mixture Density Network (MDN) is then employed to explicitly model posterior PDFs via Gaussian mixture models (GMMs). Performance is evaluated on the HSC GalaxiesML dataset (which serves as a small-scale proxy for next-generation surveys like LSST) and benchmarked against the BNN architecture established by Jones et al. (2024). The proposed model consistently outperforms the BNN baseline, achieving a $\sim 10\%$ improvement in point-estimation accuracy (specifically across RMSE, MAE, scatter, and $σ_{\text{NMAD}}$) and a $\sim 20\%$ reduction in the rates of both general and catastrophic outliers. A uniform probability integral transform (PIT) distribution confirms well-calibrated probabilistic outputs. Furthermore, the PDF-based confidence metric $z_{\text{conf}}$ enables high-purity catalog construction: excluding just approximately $4\%$ of extremely low-confidence ($z_{\text{conf}} < 0.05$) samples reduces the overall outlier rate by $\sim 48\%$.

astro-ph.GA↗

Multimodal Emotion Recognition with Large Language Models

Multimodal Emotion Recognition (MER) focuses on identifying and interpreting emotions from modality-compound inputs. Closely mirroring human cognitive processes in real-world environments, MER has drawn substantial attention from both academia and industry. Recently, a paradigm shift has been unveiled in MER, from leveraging small-scale, task-specific models to Large Language Models (LLMs). We refer to the latter as the MER-with-LLMs paradigm, which offers unprecedented generality, spurring numerous empirical attempts, even alongside speculation about LLMs' potential to achieve general emotional intelligence. However, with these new opportunities come new challenges, including the scarcity of emotionally annotated data, the affective gap both within and across modalities, and the opacity of affective interpretation. To systematically review existing research and guide future exploration, this paper categorizes prior works according to their focus on addressing these challenges into three directions: Affective Data Augmentation, Multimodal Affective Representation, and Multimodal Affective Reasoning. By thoroughly tracing the development, emerging trends, and remaining issues within each direction, this paper aims to provide a clear academic map of the MER-with-LLMs paradigm and foster its structured advancement.

cs.MM↗

Rigidity and flexibility under spectral Ricci lower bounds and mean-convex boundary

We study Riemannian manifolds $(M^n,g)$ with mean-convex boundary whose Ricci curvature is nonnegative in a spectral sense. Our first main result is a sharp spectral extension of a rigidity theorem by Kasue: we prove that under the conditions \[ λ_1(-γΔ+\mathrm{Ric})\geq 0,\qquad H_{\partial M}\geq 0, \] and in the sharp range $0\leq γ<4$ if $n=2$, and $0\leqγ<\frac{n-1}{n-2}$ if $n\geq3$, a (possibly noncompact) complete manifold with disconnected boundary, with at least one compact boundary component, must split isometrically as a product $[0,L]\times Σ$. Our second main contribution is a topological rigidity result for the relative fundamental group $π_1(M,\partial M)$, combined with a deep theorem of Lawson--Michelsohn. We prove that, in dimensions $n\neq4$, any compact manifold with boundary satisfying the two inequalities above, with at least one of them strict, admits a metric with positive sectional curvature and strictly mean-convex boundary, provided $γ\geq0$ if $n=2$, and $0\leqγ\leq\frac{n-1}{n-2}$ if $n\geq3$. This range of $γ$ is sharp for the latter result to hold.

math.DG↗