arXiv subjects

Ming Shi

Publications and source records attributed to Ming Shi.

At least 19 recordsLinked to original sources

arXiv2026

Provably Efficient Personalized Multi-Objective Bandits with Proactive Conversational Queries

Personalized decision-making in multi-objective bandits requires learning user-specific trade-offs among competing objectives. Since arm utility depends on both unknown rewards and unknown preferences, existing methods infer preferences only from utility feedback, entangling preference learning with reward exploration. In practice, however, users often reveal their priorities through proactive conversational queries (e.g., "cheap and clean hotel"), yet this structured signal is not leveraged. We formalize a proactive query-based framework in which user queries provide structured preference signals. Modeling these signals via a Plackett-Luce subset choice model, we show that query-only learning is insufficient due to a fundamental shift-invariance barrier. To resolve this, we introduce MO-PQUCB, a hybrid algorithm that integrates query-based preference anchoring with bandit feedback through shift-invariant regularization and dual-exploration UCB. We prove that proactive queries accelerate preference estimation and yield improved regret scaling over prior preference-aware MO-MAB methods. Under corrupted queries, we further characterize statistical limits and design a robust estimator achieving near-optimal performance when the corruption is sparse. Experiments validate both theoretical and practical gains.

cs.LG↗

arXiv2026

Antiferromagnetic Dimers in the Parent Phase of a Correlated Kagome Superconductor

Kagome metals are prone to charge-density wave (CDW), magnetic, and superconducting phases, with their flat electronic band conducive for correlated physics. In contrast to the weakly correlated $A$V$_3$Sb$_5$ ($A$ = K, Rb, Cs) kagome metals with a $2\times2$ CDW, CsCr$_3$Sb$_5$ is a correlated metal with a flat band close to the Fermi level, and exhibits a $4\times1$ CDW intertwined with magnetic order. Under pressure, the intertwined orders are suppressed and give way to a dome of superconductivity that emerges from a non-Fermi liquid normal state. Here, we solve the crystal structure of the $4\times 1$ CDW state in CsCr$_3$Sb$_5$, and show it consists of Cr dimers separated by Cr chains. First-principles calculations show the dominant exchange interaction is antiferromagnetic within the dimers, while the intra-chain and dimer-chain couplings are much weaker. The CDW transition of CsCr$_3$Sb$_5$ is found to be more strongly first-order than those in $A$V$_3$Sb$_5$, without significant soft phonons or diffuse scattering above the CDW transition temperature. These findings suggest that fluctuating antiferromagnetic dimers may play a major role in the electron pairing of superconducting CsCr$_3$Sb$_5$.

cond-mat.str-el↗

arXiv2026

A Queueing-Theoretic Framework for Dynamic Attack Surfaces: Data-Integrated Risk Analysis and Adaptive Defense

We develop a queueing-theoretic framework to model the temporal evolution of cyber-attack surfaces, where the number of active vulnerabilities is represented as the backlog of a queue. Vulnerabilities arrive as they are discovered or created, and leave the system when they are patched or successfully exploited. Building on this model, we study how automation affects attack and defense dynamics by introducing an AI amplification factor that scales arrival, exploit, and patching rates. Our analysis shows that even symmetric automation can increase the rate of successful exploits. We validate the model using vulnerability data collected from an open source software supply chain and show that it closely matches real-world attack surface dynamics. Empirical results reveal heavy-tailed patching times, which we prove induce long-range dependence in vulnerability backlog and help explain persistent cyber risk. Utilizing our queueing abstraction for the attack surface, we develop a systematic approach for cyber risk mitigation. We formulate the dynamic defense problem as a constrained Markov decision process with resource-budget and switching-cost constraints, and develop a reinforcement learning (RL) algorithm that achieves provably near-optimal regret. Numerical experiments validate the approach and demonstrate that our adaptive RL-based defense policies significantly reduce successful exploits and mitigate heavy-tail queue events. Using trace-driven experiments on the ARVO dataset, we show that the proposed RL-based defense policy reduces the average number of active vulnerabilities in a software supply chain by over 90% compared to existing defense practices, without increasing the overall maintenance budget. Our results allow defenders to quantify cumulative exposure risk under long-range dependent attack dynamics and to design adaptive defense strategies with provable efficiency.

cs.CR↗

arXiv2026

Regret Bounds for Reinforcement Learning from Multi-Source Imperfect Preferences

Reinforcement learning from human feedback (RLHF) replaces hard-to-specify rewards with pairwise trajectory preferences, yet regret-oriented theory often assumes that preference labels are generated consistently from a single ground-truth objective. In practical RLHF systems, however, feedback is typically \emph{multi-source} (annotators, experts, reward models, heuristics) and can exhibit systematic, persistent mismatches due to subjectivity, expertise variation, and annotation/modeling artifacts. We study episodic RL from \emph{multi-source imperfect preferences} through a cumulative imperfection budget: for each source, the total deviation of its preference probabilities from an ideal oracle is at most $\omega$ over $K$ episodes. We propose a unified algorithm with regret $\tilde{O}(\sqrt{K/M}+\omega)$, which exhibits a best-of-both-regimes behavior: it achieves $M$-dependent statistical gains when imperfection is small (where $M$ is the number of sources), while remaining robust with unavoidable additive dependence on $\omega$ when imperfection is large. We complement this with a lower bound $\tilde{\Omega}(\max\{\sqrt{K/M},\omega\})$, which captures the best possible improvement with respect to $M$ and the unavoidable dependence on $\omega$, and a counterexample showing that na\"ively treating imperfect feedback as oracle-consistent can incur regret as large as $\tilde{\Omega}(\min\{\omega\sqrt{K},K\})$. Technically, our approach involves imperfection-adaptive weighted comparison learning, value-targeted transition estimation to control hidden feedback-induced distribution shift, and sub-importance sampling to keep the weighted objectives analyzable, yielding regret guarantees that quantify when multi-source feedback provably improves RLHF and how cumulative imperfection fundamentally limits it.

cs.LG↗

arXiv2026

Probe-then-Commit Multi-Objective Bandits: Theoretical Benefits of Limited Multi-Arm Feedback

We study an online resource-selection problem motivated by multi-radio access selection and mobile edge computing offloading. In each round, an agent chooses among $K$ candidate links/servers (arms) whose performance is a stochastic $d$-dimensional vector (e.g., throughput, latency, energy, reliability). The key interaction is \emph{probe-then-commit (PtC)}: the agent may probe up to $q>1$ candidates via control-plane measurements to observe their vector outcomes, but must execute exactly one candidate in the data plane. This limited multi-arm feedback regime strictly interpolates between classical bandits ($q=1$) and full-information experts ($q=K$), yet existing multi-objective learning theory largely focuses on these extremes. We develop \textsc{PtC-P-UCB}, an optimistic probe-then-commit algorithm whose technical core is frontier-aware probing under uncertainty in a Pareto mode, e.g., it selects the $q$ probes by approximately maximizing a hypervolume-inspired frontier-coverage potential and commits by marginal hypervolume gain to directly expand the attained Pareto region. We prove a dominated-hypervolume frontier error of $\tilde{O} (K_P d/\sqrt{qT})$, where $K_P$ is the Pareto-frontier size and $T$ is the horizon, and scalarized regret $\tilde{O} (L_\phi d\sqrt{(K/q)T})$, where $\phi$ is the scalarizer. These quantify a transparent $1/\sqrt{q}$ acceleration from limited probing. We further extend to \emph{multi-modal probing}: each probe returns $M$ modalities (e.g., CSI, queue, compute telemetry), and uncertainty fusion yields variance-adaptive versions of the above bounds via an effective noise scale.

cs.LG↗

arXiv2026

Bi-Level Online Provisioning and Scheduling with Switching Costs and Cross-Level Constraints

We study a bi-level online provisioning and scheduling problem motivated by network resource allocation, where provisioning decisions are made at a slow time scale while queue-/state-dependent scheduling is performed at a fast time scale. We model this two-time-scale interaction using an upper-level online convex optimization (OCO) problem and a lower-level constrained Markov decision process (CMDP). Existing OCO typically assumes stateless decisions and thus cannot capture MDP network dynamics such as queue evolution. Meanwhile, CMDP algorithms typically assume a fixed constraint threshold, whereas in provisioning-and-scheduling systems, the threshold varies with online budget decisions. To address these gaps, we study bi-level OCO-CMDP learning under switching costs (budget reprovisioning/system reconfiguration) and cross-level constraints that couple budgets to scheduling decisions. Our new algorithm solves this learning problem via several non-trivial developments, including a carefully designed dual feedback that returns the budget multiplier as sensitivity information for the upper-level update and a lower level that solves a budget-adaptive safe exploration problem via an extended occupancy-measure linear program. We establish near-optimal regret and high-probability satisfaction of the cross-level constraints.

cs.LG↗

arXiv2026

Communication-Corruption Coupling and Verification in Cooperative Multi-Objective Bandits

We study cooperative stochastic multi-armed bandits with vector-valued rewards under adversarial corruption and limited verification. In each of $T$ rounds, each of $N$ agents selects an arm, the environment generates a clean reward vector, and an adversary perturbs the observed feedback subject to a global corruption budget $\Gamma$. Performance is measured by team regret under a coordinate-wise nondecreasing, $L$-Lipschitz scalarization $\phi$, covering linear, Chebyshev, and smooth monotone utilities. Our main contribution is a communication-corruption coupling: we show that a fixed environment-side budget $\Gamma$ can translate into an effective corruption level ranging from $\Gamma$ to $N\Gamma$, depending on whether agents share raw samples, sufficient statistics, or only arm recommendations. We formalize this via a protocol-induced multiplicity functional and prove regret bounds parameterized by the resulting effective corruption. As corollaries, raw-sample sharing can suffer an $N$-fold larger additive corruption penalty, whereas summary sharing and recommendation-only sharing preserve an unamplified $O(\Gamma)$ term and achieve centralized-rate team regret. We further establish information-theoretic limits, including an unavoidable additive $\Omega(\Gamma)$ penalty and a high-corruption regime $\Gamma=\Theta(NT)$ where sublinear regret is impossible without clean information. Finally, we characterize how a global budget $\nu$ of verified observations restores learnability. That is, verification is necessary in the high-corruption regime, and sufficient once it crosses the identification threshold, with certified sharing enabling the team's regret to become independent of $\Gamma$.

cs.LG↗

arXiv2026

Common sublattice-pure van Hove singularities in the kagome superconductors $\textit{A}$V$_{3}$Sb$_{5}$ ($\textit{A}$ = K, Rb, Cs)

Kagome materials offer a versatile platform for exploring correlated and topological quantum states, where van Hove singularities (VHSs) play a pivotal role in driving electronic instabilities, exhibiting distinct behaviors depending on electron filling and interaction settings. In the recently discovered kagome superconductors $\textit{A}$V$_{3}$Sb$_{5}$ ($\textit{A}$ = K, Rb, Cs), unconventional charge density wave order, superconductivity, and electronic chirality emerge, yet the nature of VHSs near the Fermi level ($\textit{E}$$_{F}$) and their connection to these exotic orders remain elusive. Here, using high-resolution polarization-dependent angle-resolved photoemission spectroscopy, we uncover a universal electronic structure across $\textit{A}$V$_{3}$Sb$_{5}$ that is distinct from density-functional theory predictions that show noticeable discrepancies. We identify multiple common sublattice-pure VHSs near $\textit{E}$$_{F}$, arising from strong V-$\textit{d}$/Sb-$\textit{p}$ hybridization, which significantly promote bond-order fluctuations and likely drive the observed charge density wave order. These findings provide direct spectroscopic evidence for hybridization-driven VHS formation in kagome metals and establish a unified framework for understanding the intertwined electronic instabilities in $\textit{A}$V$_{3}$Sb$_{5}$.

cond-mat.supr-con↗

arXiv2025

Observation of hidden altermagnetism in Cs$_{1-\delta}$V$_2$Te$_2$O

Altermagnets are characterized by anisotropic band/spin splittings in momentum space, dictated by their spin-space group symmetries. However, the real-space modulations of altermagnetism are often neglected and have not been explored experimentally. Here we combine neutron diffraction, angle-resolved photoemission spectroscopy (ARPES), spin-resolved ARPES and density functional theory to demonstrate that Cs$_{1-\delta}$V$_2$Te$_2$O realizes a spatially modulated form of altermagnetism, i.e., hidden altermagnetism. Such a state in Cs$_{1-\delta}$V$_2$Te$_2$O results from its G-type antiferromagnetism and two-dimensional electronic states, allowing for the development of spatially alternating altermagnetic layers, whose local spin polarizations are directly verified by spin-resolved ARPES measurements. Our experimental discovery of hidden altermagnetism broadens the scope of unconventional magnetism and opens routes to exploring emergent phenomena from real-space modulations of altermagnetic order.

cond-mat.mtrl-sci↗

arXiv2025

Voltage-Regulated Sparse Optimization for Proactive Diagnosis of Voltage Collapses

This paper aims to proactively diagnose and manage the voltage collapse risks, i.e., the risk of bus voltages violating the safe operational bounds, which can be caused by extreme events and contingencies. We jointly answer two resilience-related research questions: (Q1) Survivability: Upon having an extreme event/contingency, will the system remain feasible with voltage staying within a (preferred) safe range? (Q2) Dominant Vulnerability: If voltage collapses, what are the dominant sources of system vulnerabilities responsible for the failure? This highlights some key locations worth paying attention to in the planning or decision-making process. To address these questions, we propose a voltage-regulated sparse optimization that finds a minimal set of bus locations along with quantified compensations (corrective actions) that can simultaneously enforce AC network balance and voltage bounds. Results on transmission systems of varying sizes (30-bus to 2383-bus) demonstrate that the proposed method effectively mitigates voltage collapses by compensating at only a few strategically identified nodes, while scaling efficiently to large systems, taking on average less than 4 min for 2000+ bus cases. This work can further serve as a backbone for more comprehensive and actionable decision-making, such as reactive power planning to fix voltage issues.

eess.SY↗

arXiv2025

Soft Phonon Charge-Density Wave Formation in the Kagome Metal KV$_3$Sb$_5$

A range of of unusual emergent behaviors have been reported in the charge-density wave (CDW) state of the $A$V$_3$Sb$_5$ ($A=~$K, Rb, Cs) kagome metals, including a CDW formation process without soft phonons, which points to an unconventional CDW mechanism. Here, we use inelastic x-ray scattering to show that the CDW in KV$_3$Sb$_5$ forms via phonons that soften to zero energy at the CDW ordering vector ($L$-point) around $T_{\rm CDW}=78$~K. The intensity of soft phonons exhibit a remarkable in-plane anisotropy, extending over a much larger momentum range along $L$-$A$ relative to $L$-$H$, which leads to diffuse scattering common among $A$V$_3$Sb$_5$. Using first-principles calculations, we find that the momentum-dependent electron-phonon coupling (EPC) is peaked at $L$ and exhibits the same in-plane anisotropy as the phonon softening. Conversely, the electronic susceptibility is not peaked at $L$ and shows the opposite in-plane anisotropy. Our findings favor momentum-dependent EPC as the driving mechanism of the CDW in KV$_3$Sb$_5$, with a CDW formation process similar to that of transition metal dichalcogenides.

cond-mat.supr-con↗

arXiv2025

Online Learning for Optimizing AoI-Energy Tradeoff under Unknown Channel Statistics

We consider a real-time monitoring system where a source node (with energy limitations) aims to keep the information status at a destination node as fresh as possible by scheduling status update transmissions over a set of channels. The freshness of information at the destination node is measured in terms of the Age of Information (AoI) metric. In this setting, a natural tradeoff exists between the transmission cost (or equivalently, energy consumption) of the source and the achievable AoI performance at the destination. This tradeoff has been optimized in the existing literature under the assumption of having a complete knowledge of the channel statistics. In this work, we develop online learning-based algorithms with finite-time guarantees that optimize this tradeoff in the practical scenario where the channel statistics are unknown to the scheduler. In particular, when the channel statistics are known, the optimal scheduling policy is first proven to have a threshold-based structure with respect to the value of AoI (i.e., it is optimal to drop updates when the AoI value is below some threshold). This key insight was then utilized to develop the proposed learning algorithms that surprisingly achieve an order-optimal regret (i.e., $O(1)$) with respect to the time horizon length.

cs.NI↗

arXiv2025

Discovery of nodal-line superconductivity in chiral crystals

Chiral crystals, whose key feature is the structural handedness, host exotic quantum phenomena driven by the interplay of band topology, spin-orbit coupling (SOC), and electronic correlations. Due to the limited availability of suitable chiral-crystal materials, their unconventional superconductivity (SC) remains largely unexplored. Here, we report the discovery of unconventional SC in the La(Rh,Ir)Si family of materials by combining muon-spin spectroscopy, band-structure calculations, and perturbation theory. This family, characterized by a double-helix chiral structure, hosts exotic multifold fermions that are absent in other topological chiral crystals. While LaRhSi behaves as a fully-gapped superconductor, the substitution of 4$d$-Rh by 5$d$-Ir significantly enhances the SOC and leads to the emergence of topological nodal-line SC in LaIrSi. The developed model shows that the nodal-line SC arises from an isotropic SOC with a specific strength. Such an exotic mechanism expands our conventional understanding of material candidates for unconventional SC, which typically rely on a significantly anisotropic SOC to promote the triplet pairing. Our work establishes a new type of phase diagram, which provides a comprehensive roadmap for identifying and engineering unconventional SC in chiral crystals. Furthermore, it calls for renewed investigations of unconventional SC in other widely studied superconductors with a chiral structure.

cond-mat.supr-con↗

arXiv2025

Large ferromagnetic-like band splitting in ultrathin ${\mathrm{SmC}}_{6}$ films

Two-dimensional (2D) magnetic materials provide a unique platform for exploring quantum phases from magnetic order in reduced dimensions. While there have been extensive studies on 2D magnetic materials based on 3$d$ electrons, experimental studies on 4$f$-electron counterparts are far fewer, particularly on their electronic structure. In this study, we report the successful synthesis of ultrathin ${\mathrm{SmC}}_{6}$ films using molecular beam epitaxy. Utilizing in situ angle-resolved photoemission spectroscopy (ARPES), we uncover a large band splitting in the valence bands, which we attribute to the ferromagnetic order driven by exchange couplings between Sm 4$f$ moments and conduction electrons. Despite the small magnetic moment of Sm, the observed splitting is comparable to those of Eu- and Gd-based systems with much larger local moments. Interestingly, the surface state also exhibits splitting with similar magnitude and can be eliminated by overannealing, while the valence bands with ferromagnetic-like splittings remain robust. Our work provides spectroscopic insight to understand the electronic origin of magnetic order in Sm-based compounds. Our study also offers a platform to study 2D magnetic materials based on 4$f$ electrons.

cond-mat.str-el↗

arXiv2025

Catalogue of chiral phonon materials

Chiral phonons, circularly polarized lattice vibrations carrying intrinsic angular momentum, offer unprecedented opportunities for controlling heat flow, manipulating quantum states through spin-phonon coupling, and realizing exotic transport phenomena. Despite their fundamental importance, a universal framework for identifying and classifying these elusive excitations has remained out of reach. Here, we address this challenge by establishing a comprehensive symmetry-based theory that systematically classifies the helicity and the velocity-angular momentum tensor underlying phonon magnetization in thermal transport across all 230 crystallographic space groups. Our approach, grounded in fundamental representations of phononic angular momentum, reveals three distinct classes of crystals: achiral crystals with vanishing angular momentum, chiral crystals with s-wave helicity, and achiral crystals exhibiting higher-order helicity patterns beyond the s-wave. By performing high-throughput computations and symmetry analysis of the dynamical matrices for 11614 crystalline compounds, we identified 2738 materials exhibiting chiral phonon modes and shortlisted the 170 most promising candidates for future experimental investigation. These results are compiled into an open-access Chiral Phonon Materials Database website, enabling rapid screening for materials with desired chiral phonon properties. Our theoretical framework transcends phonons--it provides a universal paradigm for classifying chiral excitations in crystalline lattices, from magnons to electronic quasiparticles.

cond-mat.mtrl-sci↗

arXiv2025

$3d$ flat bands and coupled $4f$ moments in the kagome-honeycomb permanent magnet Sm$_{2}$Co$_{17}$

Rare earth permanent magnets (REPMs) with both localized moments and itinerant conduction bands are not only important for fundamental research but also have significant technological applications. In particular, Sm$_{\rm 2}$Co$_{\rm 17}$ is a prototypical high-temperture REPM, where the Co atoms form a kagome-honeycomb stacked lattice. Here we report synthesis of epitaxial Sm$_{\rm 2}$Co$_{\rm 17}$ films using molecular beam epitaxy and measurements of their momentum-resolved electronic structure from \textit{in-situ} angle-resolved photoemission spectroscopy. Our results unveil two flat bands from Co $3d$ orbitals near the Fermi level ($E_F$), one at $\sim$\,--300\,meV and another right at $E_F$, which arise from orbital-selective destructive interference and strong electron correlations, respectively. In addition, our results reveal that Sm $4f$ states are far away from $E_F$ (hence mostly localized) and exhibit an anomalous temperature dependence, caused by the $3d$-$4f$ magnetic coupling. Our findings provide direct spectroscopic insights to understand the strong uniaxial ferromagnetism in Sm$_{\rm 2}$Co$_{\rm 17}$ (and REPMs alike). Our work also opens avenues to explore flat-band physics near $E_F$ and emergent phenomena in correlated kagome-honeycomb lattices.

cond-mat.str-el↗

arXiv2025

Provably Efficient RL for Linear MDPs under Instantaneous Safety Constraints in Non-Convex Feature Spaces

In Reinforcement Learning (RL), tasks with instantaneous hard constraints present significant challenges, particularly when the decision space is non-convex or non-star-convex. This issue is especially relevant in domains like autonomous vehicles and robotics, where constraints such as collision avoidance often take a non-convex form. In this paper, we establish a regret bound of $\tilde{\mathcal{O}}\bigl(\bigl(1 + \tfrac{1}{\tau}\bigr) \sqrt{\log(\tfrac{1}{\tau}) d^3 H^4 K} \bigr)$, applicable to both star-convex and non-star-convex cases, where $d$ is the feature dimension, $H$ the episode length, $K$ the number of episodes, and $\tau$ the safety threshold. Moreover, the violation of safety constraints is zero with high probability throughout the learning process. A key technical challenge in these settings is bounding the covering number of the value-function class, which is essential for achieving value-aware uniform concentration in model-free function approximation. For the star-convex setting, we develop a novel technique called Objective Constraint-Decomposition (OCD) to properly bound the covering number. This result also resolves an error in a previous work on constrained RL. In non-star-convex scenarios, where the covering number can become infinitely large, we propose a two-phase algorithm, Non-Convex Safe Least Squares Value Iteration (NCS-LSVI), which first reduces uncertainty about the safe set by playing a known safe policy. After that, it carefully balances exploration and exploitation to achieve the regret bound. Finally, numerical simulations on an autonomous driving scenario demonstrate the effectiveness of NCS-LSVI.

cs.LG↗

arXiv2025

Provably Efficient Multi-Objective Bandit Algorithms under Preference-Centric Customization

Multi-objective multi-armed bandit (MO-MAB) problems traditionally aim to achieve Pareto optimality. However, real-world scenarios often involve users with varying preferences across objectives, resulting in a Pareto-optimal arm that may score high for one user but perform quite poorly for another. This highlights the need for customized learning, a factor often overlooked in prior research. To address this, we study a preference-aware MO-MAB framework in the presence of explicit user preference. It shifts the focus from achieving Pareto optimality to further optimizing within the Pareto front under preference-centric customization. To our knowledge, this is the first theoretical study of customized MO-MAB optimization with explicit user preferences. Motivated by practical applications, we explore two scenarios: unknown preference and hidden preference, each presenting unique challenges for algorithm design and analysis. At the core of our algorithms are preference estimation and preference-aware optimization mechanisms to adapt to user preferences effectively. We further develop novel analytical techniques to establish near-optimal regret of the proposed algorithms. Strong empirical performance confirm the effectiveness of our approach.

cs.LG↗