Search arXiv⌕ Search

arXiv subjects

Lu Chen

Publications and source records attributed to Lu Chen.

At least 37 records · Page 2Linked to original sources

Multiplicity One for Strictly Stable Anisotropic Allen-Cahn Minimal Hypersurfaces

In this paper, we study the multiplicity of smooth limit interfaces for the anisotropic Allen-Cahn equation on closed Riemannian manifolds. We prove that an isolated smooth limit interface has multiplicity one whenever it is a closed, embedded, two-sided, strictly \(F\)-stable \(F\)-minimal hypersurface. The proof uses anisotropic barriers and a sliding argument to confine the nodal sets to a neighborhood of width \(O(\varepsilon)\). We then classify the nonconstant rescaled limits as one-dimensional solutions and obtain an energy upper bound near the limiting hypersurface. Exponential decay controls the remaining energy, yielding the multiplicity-one conclusion.

math.AP↗

PsyEvo: A Personalized Counseling Agent That Self-Evolves at Test Time

Mental health disorders affect a substantial proportion of the global population, yet a persistent shortage of trained practitioners leaves the majority without adequate care. Large language model (LLM)-based counselors present a promising direction for delivering scalable conversational psychological support. Offline model training alone leaves limited room to adapt to individual clients or to learn from ongoing therapeutic interaction at test time. We introduce PsyEvo, an LLM-based counseling framework that enables both client-specific personalization and response-policy improvement at test time through three components: Hierarchical Bayesian Skill Policy (HBSP) personalizes what intervention to apply by maintaining a per-client skill posterior updated from session feedback; Inter-session Listwise Preference Optimization (LiPO) improves how the selected skill is expressed by updating a shared response adapter from cross-client preference evidence; and State-conditioned Ordinal Credit Assignment (SOCA) supplies candidate preferences and trajectory credit to the two components through consistency-checked comparisons and ordinal projection. In simulated-client evaluation with shared online cohort adaptation, PsyEvo obtains 7.684 Overall on PsychEval and exceeds every component variant in each of three matched runs. Removing individual components lowers mean overall score by 0.138--0.171 under the shared configuration, supporting conditional contributions within the complete scaffold. Our code is available at https://github.com/Lingxi-mental-health/PsyEvo

cs.AI↗

Determining $W^{1,n}$ conductivities in Calderón's problem for $n\geq4$

We establish a global uniqueness result at the critical Sobolev regularity for the isotropic Calderón problem in all dimensions $n\ge 4$. More precisely, for every $n\ge4$ and every bounded Lipschitz domain $Ω\subset\mathbb{R}^n$, any real-valued, uniformly elliptic scalar conductivity $γ\in W^{1,n}(Ω)$ is uniquely determined by its full Dirichlet-to-Neumann map. This settles a long-standing open problem in the field. To prove uniqueness at this endpoint, we develop an averaged trace norm method, which combines complex geometrical optics with trace norm estimates averaged over wave orientations.

math.AP↗

DeepSurvey: Agent-Oriented Automated Survey Generation with Analytical Depth and Citation Reliability

As scientific literature grows rapidly and research increasingly involves AI agents, automated survey generation has become a key capability for both agents and human researchers. For such agents, a survey serves as a primary knowledge source of a field prior to research. Since pretrained models already encode broad knowledge of established work, these consumers benefit more from analytical depth than from breadth alone; moreover, unsupported claims, once ingested as knowledge, can propagate into downstream research. However, existing systems tend to overemphasize coverage and presentation; they suffer from limited analytical depth due to reliance on abstracts and isolated paper processing, and from unreliable citations due to imprecise retrieval and post-hoc grounding. We present DeepSurvey, an agentic generation system that addresses both limitations. To enhance depth, DeepSurvey extracts structured keynotes, models cross-paper relationships through clustering and comparative analysis, and integrates a code-agent subsystem to recover implementation-level details. To fortify reliability, it combines citation-graph expansion with hybrid filtering for topic-focused retrieval, enforces evidence-constrained analysis and writing, and deploys multi-granularity agentic refinement to validate citation--claim alignment. Experiments show that DeepSurvey achieves the highest content score (8.34/10) and citation quality (recall and precision gains of 25.3\% and 35.2\% over the strongest baseline), generalizes more robustly across domains, and is preferred by domain experts over human-written surveys (83.3\% in overall quality, 100\% in content depth). Moreover, when a coding agent uses a survey as its only literature source, the agent equipped with DeepSurvey achieves the best performance among human-written and baseline-generated surveys.

cs.AI↗

Affordance-Conditioned Decision Making: Bridging the Semantic-Spatial Gap in Zero-Shot Cross-Floor Vision-and-Language Navigation

Vision-and-language navigation increasingly relies on general-purpose semantic planners, yet translating correct high-level intent into reliable physical execution remains difficult in spatially constrained transitions. Reaching a staircase, doorway, or narrow passage does not ensure traversal; the agent must identify an executable affordance pose and recover from accumulated action errors. We propose PACE (Preference-refined Affordance-Conditioned Execution), a supervised local execution module that augments frozen zero-shot semantic planners for reliable cross-floor navigation. PACE grounds transition-related semantics into a long-horizon, agent-centric traversable affordance pose and conditions short-horizon action generation on this spatial target, thereby aligning semantic goals with physical execution. We further post-train PACE through failure-aware preference refinement using rollout-derived pairs that contrast normal or recovery behaviors with deviation-amplifying behaviors, thereby improving closed-loop correction. We integrate PACE into six open-source zero-shot VLN navigators and demonstrate consistent improvements on the cross-floor subsets of R2R-CE and RxR-CE, increasing the average success rate from 16.35% to 27.65% and from 4.76% to 12.06%, respectively. Real-world experiments further demonstrate PACE's applicability in unseen environments, highlighting the potential of traversable affordances to bridge semantic intent and reliable embodied behavior.

cs.RO↗

MatToolBench: Benchmarking Multimodal Agents in Real-World Materials Science Workflows

Multimodal GUI agents have achieved impressive results on general software benchmarks, yet their ability to operate professional scientific software remains largely unexplored. In materials science, sparse domain-specific web data, specialized interfaces, and tacit workflow conventions create blind spots that general-purpose pretraining cannot readily bridge. We present MatToolBench, the first real-environment benchmark for evaluating multimodal GUI agents on professional materials science software, comprising 204 tasks across 10 tools in three modalities: GUI operation, OriginPro scripting, and code-based database queries, all executed inside a Windows 11 VM. Each task is decomposed into fine-grained sub-criteria by domain experts, enabling interpretable partial-credit scoring; the GUI component of our multi-level evaluation pipeline achieves an average F1 of 0.98. For OriginPro figure-generation tasks, we further conduct a human-LLM agreement study to validate the use of a multimodal judge for secondary aesthetic assessment. Our experiments show that strong performance on general benchmarks does not transfer to professional scientific workflows, and that this gap is not a visual-grounding problem alone: failures arise from domain-specific operational knowledge, sparse pretraining coverage of scientific software, weak cross-tool artifact handoff, and critical states exposed only visually. Even the best model reaches only 25% success rate on GUI tasks and 45% on code tasks. MatToolBench therefore serves as a challenging diagnostic benchmark and real-environment testbed for data-scarce, knowledge-intensive scientific workflows.

cs.AI↗

Making AI Scientists Auditable from Evidence to Claim

AI research systems can report improved results without establishing that the tested implementation matches the method described in their conclusions. We introduce Xcientist, a research harness that connects literature review, component-based idea generation, experiment validation and reporting. An evidence graph retains source passages, methods, baselines and evaluation conditions; component records track design revisions; and validation contracts specify the implementation, comparisons and artifacts required at each stage. We define claim drift as an unresolved mismatch between an accepted claim and its attributed sources, code or experiments. A retrospective audit across agent memory, traffic forecasting and physics-informed learning found audit claim drift rates of 3.6--16.7\% for Xcientist, lower than those of each of three comparison systems in all nine task-by-relation comparisons. This measure includes both confirmed mismatches and unverifiable claims; most of the difference arose from fewer unverifiable records. The case studies also document performance gains, unsuccessful revisions and limits on component attribution. This technical report describes the system, its implementation and the records needed to check how a proposed idea became a tested method and a final claim.

cs.AI↗

Quasianalyticity and geometric rigidity in anisotropic Calderón's problem

The anisotropic Calderón problem of determining a smooth Riemannian metric from boundary measurements, up to a boundary-fixing diffeomorphism, remains open in dimensions $n\ge3$~\cite{uhlmann2009electrical}. We establish unique identifiability results in two complementary regimes. In the first, the identity principle for quasianalytic functions propagates boundary information and yields unique identifiability on compact manifolds without a prescribed product structure, including a partial-data consequence; under a prescribed normal geometry, quasianalyticity is needed only in the distinguished direction. In the second, suitable symmetry or one-sided ordering assumptions lead to unique identifiability at $C^\infty$ regularity with full or restricted boundary access. Taken together, the results exhibit a tradeoff among regularity, geometric structure, and boundary access: quasianalyticity supplies continuation when no global product structure is prescribed, while symmetry or one-sided order replaces that continuation at $C^\infty$ regularity.

math.AP↗

Transcriptomic Models for Immunotherapy Response Prediction Show Limited Cross-cohort Generalisability

Immune checkpoint inhibitors (ICIs) have transformed cancer therapy; yet substantial proportion of patients exhibit intrinsic or acquired resistance, making accurate pre-treatment response prediction a critical unmet need. Transcriptomics-based biomarkers derived from bulk and single-cell RNA sequencing (scRNA-seq) offer a promising avenue for capturing tumour-immune interactions, yet the cross-cohort generalisability of existing prediction models remains unclear.We systematically benchmark nine state-of-the-art transcriptomic ICI response predictors, five bulk RNA-seq-based models (COMPASS, IRNet, NetBio, IKCScore, and TNBC-ICI) and four scRNA-seq-based models (PRECISE, DeepGeneX, Tres and scCURE), using publicly available independent datasets unseen during model development. Overall, predictive performance was modest: bulk RNA-seq models performed at or near chance level across most cohorts, while scRNA-seq models showed only marginal improvements. Pathway-level analyses revealed sparse and inconsistent biomarker signals across models. Although scRNA-seq-based predictors converged on immune-related programs such as allograft rejection, bulk RNA-seq-based models exhibited little reproducible overlap. PRECISE and NetBio identified the most coherent immune-related themes, whereas IRNet predominantly captured metabolic pathways weakly aligned with ICI biology. Together, these findings demonstrate the limited cross-cohort robustness and biological consistency of current transcriptomic ICI prediction models, underscoring the need for improved domain adaptation, standardised preprocessing, and biologically grounded model design.

q-bio.GN↗

On an inverse boundary problem in elastodynamics

We study the simultaneous identification of the Lamé parameters $λ$ and $μ$ in three-dimensional static isotropic elasticity. For smooth coefficients, we establish uniqueness from the full Dirichlet-to-Neumann map when $μ$ is axisymmetric, admits a multiplicative or additive separation on a product domain, or is quasianalytic in one fixed direction. These results require neither smallness of $\nablaμ$ nor real analyticity of the coefficients, and impose no corresponding structural condition on $λ$. In the axisymmetric and separated cases, partial boundary data suffice to determine $μ$.

math.AP↗

Beyond Benefit or Risk: Perceived Impact Profiles of Human-AI Affective Interaction and Their Associations with Psychological Functioning

Relational AI increasingly serves as an emotional shelter for humans, and its impact is mixed. Prior research has focused on either positive or negative impacts, leaving unclear how they are configured within individuals and relate to psychological functioning. To address these gaps, this study used a sequential mixed-methods design. Study 1 interviewed 52 users with emotional ties to AI and identified four positive impact domains (emotional relief, loneliness alleviation, enhanced interpersonal functioning, and personal growth) and four negative impact domains (virtual-real boundary blur, social replacement, cognitive-emotional reinforcement, and excessive use). Study 2 followed 673 Chinese AI users for six months and identified four profiles of individuals differently impacted by relational AI use: minimal impact, benefit-driven impact, mixed impact, and risk-driven impact. Users in the mixed impact and risk-driven impact profiles were both high in human-AI affective bonding, but those showing risk-driven impact had greater vulnerability, indicated by higher interpersonal need frustration and emotion-regulation difficulties, more depressive and anxiety symptoms, and lower self-esteem and flourishing. Users in the benefit-driven and mixed impact profiles showed more favorable psychological functioning. After controlling for baseline functioning and relevant covariates, Wave 1 profiles did not predict five of the six Wave 2 indicators; only users in the mixed impact profile reported higher flourishing than those in the minimal impact profile. Overall, potential psychological harms associated with relational AI engagement appeared limited and selective. These findings portray relational AI as a heterogeneous socio-emotional context that may partly mirror users' states and traits, warranting individualized, adaptive safeguards.

cs.HC↗

Boundary Spectral Inequalities from Measurable Sets on $W^{2,\infty}$ manifolds and their applications

Let $(\mathcal{M},g)$ be a compact connected $W^{2,\infty}$ Riemannian manifold with nonempty boundary and a uniformly elliptic Lipschitz metric. We establish quantitative boundary spectral inequalities for both Dirichlet and Neumann eigenfunctions from arbitrary measurable subsets of $\partial\mathcal{M}\times(-s_0,s_0)$ of positive surface measure. Moreover, we apply the Dirichlet spectral inequality to establish the boundary observability estimate \[ \|u(T)\|_{L^2(\mathcal{M})}^2 \le C \int_J \|\partial_{ν_g}u(x,t)\|^2 \,\mathrm{d}S_g\,\mathrm{d}t . \] where $J\subset\partial\mathcal{M}\times(0,T)$ is measurable and has positive surface--time measure. A localized theorem requiring $W^{2,\infty}$ regularity only near the observed boundary patch is retained as a separate consequence. The proof of the observability inequality combines quantitative continuation from positive-measure boundary sets with low-frequency spectral concentration. This result shows that boundary observability of solutions to the heat equation can also be achieved in $W^{2,\infty}$ domains. Finally, as an application, we prove that measurements of the boundary normal derivative on $J$ uniquely determine the initial state of heat equation. Under an a priori bound in $D(-Δ_{g, D}^{s/2})$, the recovery satisfies a logarithmic stability estimate of optimal order $s/2$.

math.AP↗

FEAT: A Linear-Complexity Foundation Model for Extremely Large Structured Data

Structured data is widely used in domains such as healthcare, finance, and scientific data management. Recent studies on structured data foundation models (SFMs) aim to support data analysis and mining tasks over such data, but still face scalability and generalization challenges when applied to real-world enterprise databases. First, many SFMs rely on full self-attention, which introduces an O(N^2) computational bottleneck and limits the number of tuples that can be processed jointly. Second, directly replacing attention with linear-complexity sequence models may conflict with the permutation-invariant nature of structured data, introducing artificial order bias and degrading representation quality. Moreover, models trained only on synthetic data may struggle to generalize to the heavy-tailed and heterogeneous distributions commonly found in real-world databases. To address these challenges, we propose FEAT, a linear-complexity foundation model for extremely large structured data. FEAT replaces quadratic attention with a multi-layer dual-axis encoding architecture. It integrates an adaptive-fusion bidirectional state-space model (AFBM) with convolutional gated linear attention (Conv-GLA), enabling cross-tuple contextualization in O(N) time while supporting permutation-invariant representation learning. To improve robustness under real-world data skewness, FEAT further adopts a hybrid structural causal pre-training pipeline with a robust reconstruction objective. Experiments on 12 real-world database benchmarks show that FEAT consistently outperforms representative SFMs on zero-shot tasks and scales linearly with structured-data sample length, achieving up to 50x faster inference latency.

cs.LG↗

Coupled thermoacoustic resolvent analysis of a model two-stream coaxial combustor

We derived a resolvent operator to analyze the coupled flame-acoustic effect in a model two-stream coaxial combustor. The theoretical analysis accommodates both the hydrodynamic effect of the active flame and chamber acoustic effect, as well as their coupling effect. Utilizing the coupled thermoacoustic resolvent, we are able to identify the optimal forcing of different mechanisms and their corresponding optimal responses. When this new modeling tool is applied to a two-stream coaxial model combustor, it reveals distinctly different forcing-response characteristics in the coupled system compared to those in a purely hydrodynamic linear system. Acoustic energy peaks, indicative of resonance, are observed. Additionally, it has been found that the acoustic forcing does not maintain a rank-one property. Furthermore, the modes most receptive to the flame-acoustic coupling effect can be identified using a novel sensitivity analysis approach. Interestingly, by employing the coupled thermoacoustic resolvent, we demonstrate that forcing can be designed to negate or counteract perturbations caused by the forcing of another attribute, potentially aiding in the development of effective thermoacoustic control strategies.

physics.flu-dyn↗

Global recovery of Lorentzian principal geometry from the hyperbolic Dirichlet-to-Neumann map

We prove that the full Dirichlet-to-Neumann map on a finite time interval globally determines the Lorentzian metric \(\mathbf G_{g,c}=-c(x,t)^2\mathrm{d}t^2+g(x)\) encoded by the principal symbol of the wave operator. The result holds in spatial dimensions \(n\geq3\) for multiplicatively separable wave speeds \(c(x,t)=a(x)b(t)\), provided the accumulated effective time during the experiment exceeds the maximal travel time from the boundary to the interior and back. The data determine both the unknown Riemannian metric \(g(x)\) and the wave speed \(c(x,t)\) throughout the observation cylinder, up to a spatial change of coordinates that fixes the boundary and leaves the measured time unchanged. In particular, the temporal factor \(b\) is not prescribed but is recovered from the same measurements. We also construct several examples demonstrating that the dimensional and visibility conditions for uniqueness are sharp.

math.AP↗

Chart2SVG: Editable SVG Generation from Raster Chart Images

We present Chart2SVG, a multimodal large language model that converts static raster charts into structurally organized, semantically enriched SVGs that support programmatic editing. By incorporating chart-specific semantic tokens into a vision-language model, Chart2SVG captures both geometric primitives and their functional roles. To support robust structural recovery, we introduce Beagle+, a dataset of 33K canonicalized and structurally distilled chart samples. Our approach combines specialized training objectives with a rendering-aware post-training phase, producing SVGs that are both visually accurate and structurally consistent. To facilitate higher-level manipulations, we construct a Chart Structure Graph (CSG) that exposes visual dependencies, enabling tasks such as interactive exploration, chart repurposing, and layout reuse. Experiments show that Chart2SVG substantially outperforms baselines in reconstruction fidelity and downstream editing utility, advancing the development of intelligent and interactive visualization tools.

cs.LG↗

ASIL: Replacing Screenshot-and-Click with Structured State and Semantic Actions

Powerful code agents can execute scripts, call tools, and manage files, yet many important applications remain accessible primarily through graphical user interfaces. We argue that screenshot-and-click is an inefficient interface for software-operating agents: screenshots are state-incomplete, and GUI actions are brittle, semantically weak, and poorly matched to long-horizon planning. We introduce ASIL (Agent-Software Interaction Layer), an agent-native interface that exposes software through structured JSON observations and code-executable semantic actions, realized through the deepest feasible access path for each application. We instantiate ASIL across 15 applications and a benchmark of 300 single-application and 80 multi-application tasks. ASIL reaches above 80 with closed models while executing fewer than five actions per task. Under a repaired runtime and a 50-step screenshot budget, the same tasks yield 6.6 and 26.6 strict success under screenshot-and-click control, rising to 15.0 and 53.3 on an easier OSWorld-comparable band. Against application-native interfaces on matched tasks, ASIL exceeds LibreOffice's UNO API by 28-38 strict points but only matches draw.io's MCP content contract. The structured modality also suits training: small-scale SFT raises Qwen3.5-2B from 58.0 to 72.1 and Qwen3.5-9B from 66.6 to 80.4, and resource-limited on-policy RL further raises them to 74.4 and 82.2.

cs.AI↗