arXiv subjects

Ruiqi Zhang

Publications and source records attributed to Ruiqi Zhang.

At least 55 records · Page 3Linked to original sources

arXiv2025

ProxFly: Robust Control for Close Proximity Quadcopter Flight via Residual Reinforcement Learning

This paper proposes the ProxFly, a residual deep Reinforcement Learning (RL)-based controller for close proximity quadcopter flight. Specifically, we design a residual module on top of a cascaded controller (denoted as basic controller) to generate high-level control commands, which compensate for external disturbances and thrust loss caused by downwash effects from other quadcopters. First, our method takes only the ego state and controllers' commands as inputs and does not rely on any communication between quadcopters, thereby reducing the bandwidth requirement. Through domain randomization, our method relaxes the requirement for accurate system identification and fine-tuned controller parameters, allowing it to adapt to changing system models. Meanwhile, our method not only reduces the proportion of unexplainable signals from the black box in control commands but also enables the RL training to skip the time-consuming exploration from scratch via guidance from the basic controller. We validate the effectiveness of the residual module in the simulation with different proximities. Moreover, we conduct the real close proximity flight test to compare ProxFly with the basic controller and an advanced model-based controller with complex aerodynamic compensation. Finally, we show that ProxFly can be used for challenging quadcopter mid-air docking, where two quadcopters fly in extreme proximity, and strong airflow significantly disrupts flight. However, our method can stabilize the quadcopter in this case and accomplish docking. The resources are available at https://github.com/ruiqizhang99/ProxFly.

cs.RO↗

arXiv2025

A note on the lower bounds of genuine multipartite entanglement concurrence

Quantum entanglement plays a pivotal role in quantum information processing. Quantifying quantum entanglement is a challenging and essential research area within the field. This manuscript explores the relationships between bipartite entanglement concurrence, multipartite entanglement concurrence, and genuine multipartite entanglement (GME) concurrence. We derive lower bounds on GME concurrence from these relationships, demonstrating their superiority over existing results through rigorous proofs and numerical examples. Additionally, we investigate the connections between GME concurrence and other entanglement measures, such as tangle and global negativity, in multipartite quantum systems.

quant-ph↗

arXiv2025

Minimax Optimal Convergence of Gradient Descent in Logistic Regression via Large and Adaptive Stepsizes

We study $\textit{gradient descent}$ (GD) for logistic regression on linearly separable data with stepsizes that adapt to the current risk, scaled by a constant hyperparameter $η$. We show that after at most $1/γ^2$ burn-in steps, GD achieves a risk upper bounded by $\exp(-Θ(η))$, where $γ$ is the margin of the dataset. As $η$ can be arbitrarily large, GD attains an arbitrarily small risk $\textit{immediately after the burn-in steps}$, though the risk evolution may be $\textit{non-monotonic}$. We further construct hard datasets with margin $γ$, where any batch (or online) first-order method requires $Ω(1/γ^2)$ steps to find a linear separator. Thus, GD with large, adaptive stepsizes is $\textit{minimax optimal}$ among first-order batch methods. Notably, the classical $\textit{Perceptron}$ (Novikoff, 1962), a first-order online method, also achieves a step complexity of $1/γ^2$, matching GD even in constants. Finally, our GD analysis extends to a broad class of loss functions and certain two-layer networks.

stat.ML↗

arXiv2025

Magnetism-Enhanced Strong Electron-Phonon Coupling in Infinite-Layer Nickelate

Intriguing analogies between the nickelates and the cuprates provide a promising avenue for unraveling the microscopic mechanisms underlying high-$T_c$ superconductivity. While electron correlation effects in the nickelates have been extensively studied, the role of electron-phonon coupling (EPC) remains highly controversial. Here, by taking pristine LaNiO$_2$ as an exemplar nickelate, we present an in-depth study of EPC for both the non-magnetic (NM) and the $C$-type antiferromagnetic ($C$-AFM) phase using advanced density functional theory methods without invoking $U$ or other free parameters. The weak EPC strength $λ$ in the NM phase is found to be greatly enhanced ($\sim$4$\times$) due to the presence of magnetism in the $C$-AFM phase. This enhancement arises from strong interactions between the flat bands associated with the Ni-3$d_{z^2}$ orbitals and the low-frequency phonon modes driven by the vibrations of Ni and La atoms. The resulting phonon softening is shown to yield a distinctive kink in the electronic structure around 15 meV, which would provide an experimentally testable signature of our predictions. Our study highlights the critical role of local magnetic moments and interply EPC in the nickelate.

cond-mat.str-el↗

arXiv2025

Fast and Physically-based Neural Explicit Surface for Relightable Human Avatars

Efficiently modeling relightable human avatars from sparse-view videos is crucial for AR/VR applications. Current methods use neural implicit representations to capture dynamic geometry and reflectance, which incur high costs due to the need for dense sampling in volume rendering. To overcome these challenges, we introduce Physically-based Neural Explicit Surface (PhyNES), which employs compact neural material maps based on the Neural Explicit Surface (NES) representation. PhyNES organizes human models in a compact 2D space, enhancing material disentanglement efficiency. By connecting Signed Distance Fields to explicit surfaces, PhyNES enables efficient geometry inference around a parameterized human shape model. This approach models dynamic geometry, texture, and material maps as 2D neural representations, enabling efficient rasterization. PhyNES effectively captures physical surface attributes under varying illumination, enabling real-time physically-based rendering. Experiments show that PhyNES achieves relighting quality comparable to SOTA methods while significantly improving rendering speed, memory efficiency, and reconstruction quality.

cs.CV↗

arXiv2025

Mitigating Ambiguities in 3D Classification with Gaussian Splatting

3D classification with point cloud input is a fundamental problem in 3D vision. However, due to the discrete nature and the insufficient material description of point cloud representations, there are ambiguities in distinguishing wire-like and flat surfaces, as well as transparent or reflective objects. To address these issues, we propose Gaussian Splatting (GS) point cloud-based 3D classification. We find that the scale and rotation coefficients in the GS point cloud help characterize surface types. Specifically, wire-like surfaces consist of multiple slender Gaussian ellipsoids, while flat surfaces are composed of a few flat Gaussian ellipsoids. Additionally, the opacity in the GS point cloud represents the transparency characteristics of objects. As a result, ambiguities in point cloud-based 3D classification can be mitigated utilizing GS point cloud as input. To verify the effectiveness of GS point cloud input, we construct the first real-world GS point cloud dataset in the community, which includes 20 categories with 200 objects in each category. Experiments not only validate the superiority of GS point cloud input, especially in distinguishing ambiguous objects, but also demonstrate the generalization ability across different classification methods.

cs.CV↗

arXiv2025

Advances and challenges of SCAN and r2SCAN density functionals in transition-metal compounds

Transition-metal compounds (TMCs) with open-shell d-electrons are characterized by a complex interplay of lattice, charge, orbital, and spin degrees of freedom, giving rise to a diverse range of fascinating applications. Often exhibiting exotic properties, these compounds are commonly classified as correlated systems due to strong inter-electronic interactions called Hubbard U. This inherent complexity presents significant challenges to Kohn-Sham density functional theory (KS-DFT), the most widely used electronic structure method in condensed matter physics and materials science. While KS-DFT is, in principle, exact for the ground-state total energy, its exchange-correlation energy must be approximated in practice. The mean-field nature of KS implementations, combined with the limitations of current exchange-correlation density functional approximations, has led to the perception that DFT is inadequate for correlated systems, particularly TMCs. Consequently, a common workaround involves augmenting DFT with an on-site Hubbard-like U correction. In recent years, the strongly constrained and appropriately normed (SCAN) density functional, along with its refined variant r2SCAN, has achieved remarkable progress in accurately describing the structural, energetic, electronic, magnetic, and vibrational properties of TMCs, challenging the traditional perception of DFT's limitations. This review explores the design principles of SCAN and r2SCAN, highlights their key advancements in studying TMCs, explains the mechanisms driving these improvements, and addresses the remaining challenges in this evolving field.

cond-mat.mtrl-sci↗

arXiv2025

Discovery of a Highly Anisotropic Type-II Ferromagnetic Weyl State Exhibiting a 3D Quantum Hall Effect

Topological semimetals, particularly Weyl semimetals (WSMs), are crucial platforms for exploring emergent quantum phenomena due to their unique electronic structures and potential to transition into various topological phases. In this study, we report the discovery of a ferromagnetic (FM) type-II WSM in Mn(Bi1-xSbx)4Te7, which exhibits a remarkable three-dimensional (3D) quantum Hall effect (QHE). By precisely tuning the chemical potential through Sb doping, we obtained samples with the Fermi level near the charge neutrality point for x = ~ 0.27. This was confirmed by spectroscopy measurements (ARPES and STS), and these samples showed strong quantum oscillations along with a key transport signature of a Weyl state - chiral anomaly, and Fermi surface reconstruction driven by FM ordering. Our theoretical analysis indicates that this Weyl state evolves from a parent nodal ring state, where higher-order k-terms split the nodal line into type-II Weyl nodes. The Weyl state exhibits significant anisotropy, characterized by a pronounced reduction in Fermi velocity along the kz-axis, likely accounting for the observed 3D QHE. These results not only highlight the exceptional tunability of the Mn(Bi1-xSbx)4Te7 system, where precise control of the chemical potential and magnetic properties opens access to novel quantum phases, but also advance the understanding of FM WSMs.

cond-mat.mtrl-sci↗

arXiv2024

Clifford Perturbation Approximation for Quantum Error Mitigation

Quantum error mitigation (QEM) is critical for harnessing the potential of near-term quantum devices. Particularly, QEM protocols can be designed based on machine learning, where the mapping between noisy computational outputs and ideal ones can be learned on a training set consisting of Clifford circuits or near-Clifford circuits that contain only a limited number of non-Clifford gates. This learned mapping is then applied to noisy target circuits to estimate the ideal computational output. In this work, we propose a learning-based error mitigation framework called Clifford Perturbation Data Regression (CPDR), which constructs training sets by Clifford circuits with small perturbations. Specifically, these circuits are parameterized quantum circuits, where the rotation angles of the gates are restricted to a narrow range, ensuring that the gates remain close to Clifford gates. This design enables the efficient simulation of the training circuits using the Sparse Pauli Dynamics method. As a result, CPDR is able to utilize training sets with a better diversity to train the model, compared with previous learning-based QEM models that construct training sets with only Clifford or near-Clifford circuits. Numerical simulations on small-scale Ising model circuits demonstrate that the performance of CPDR dramatically outperforms that of existing methods such as Zero-Noise Extrapolation and learning-based Probabilistic Error Cancellation. Furthermore, using the experimental data from IBM's 127-qubit Eagle processor, our findings suggest that CPDR demonstrates improved accuracy compared to the original mitigation results reported in [Nature 618, 500 (2023)].

quant-ph↗

arXiv2024

Predicting Organic-Inorganic Halide Perovskite Photovoltaic Performance from Optical Properties of Constituent Films through Machine Learning

We demonstrate a machine learning (ML) approach that accurately predicts the current-voltage behavior of 3D/2D-structured (FAMA)Pb(IBr)3/OABr hybrid organic-inorganic halide perovskite (HOIP) solar cells under AM1.5 illumination. Our neural network algorithm is trained on measured responses from several hundred HOIP solar cells, using three simple optical measurements of constituent HOIP films as input: optical transmission spectrum, spectrally-resolved photoluminescence, and time-resolved photoluminescence, from which we predict the open-circuit voltage (Voc), short-circuit current (Jsc), and fill factors (FF) values of solar cells that contain the HOIP active layers. Determined average prediction accuracies for 95 % of the predicted Voc, Jsc, and FF values are 91%, 94% and 89%, respectively, with R2 coefficients of determination of 0.47, 0.77, and 0.58, respectively. Quantifying the connection between ML predictions and physical parameters extracted from the measured HOIP films optical properties, allows us to identify the most significant parameters influencing the prediction results. With separate ML-classifying algorithms, we identify degraded solar cells using the same optical input data, achieving over 90% classification accuracy through support vector machine, cross entropy loss, and artificial neural network algorithms. To our knowledge, the demonstrated regression and classification work is the first to use ML to predict device photovoltaic properties solely from the optical properties of constituent materials.

cond-mat.mtrl-sci↗

arXiv2024

Accurate Electron-phonon Interactions from Advanced Density Functional Theory

Electron-phonon coupling (EPC) is key for understanding many properties of materials such as superconductivity and electric resistivity. Although first principles density-functional-theory (DFT) based EPC calculations are used widely, their efficacy is limited by the accuracy and efficiency of the underlying exchange-correlation functionals. These limitations become exacerbated in complex $d$- and $f$-electron materials, where beyond-DFT approaches and empirical corrections, such as the Hubbard $U$, are commonly invoked. Here, using the examples of CoO and NiO, we show how the efficient r2scan density functional correctly captures strong EPC effects in transition-metal oxides without requiring the introduction of empirical parameters. We also demonstrate the ability of r2scan to accurately model phonon-mediated superconducting properties of the main group compounds (e.g., MgB$_2$), with improved electronic bands and phonon dispersions over those of traditional density functionals. Our study provides a pathway for extending the scope of accurate first principles modeling of electron-phonon interactions to encompass complex $d$-electron materials.

cond-mat.str-el↗

arXiv2024

Fast Best-of-N Decoding via Speculative Rejection

The safe and effective deployment of Large Language Models (LLMs) involves a critical step called alignment, which ensures that the model's responses are in accordance with human preferences. Prevalent alignment techniques, such as DPO, PPO and their variants, align LLMs by changing the pre-trained model weights during a phase called post-training. While predominant, these post-training methods add substantial complexity before LLMs can be deployed. Inference-time alignment methods avoid the complex post-training step and instead bias the generation towards responses that are aligned with human preferences. The best-known inference-time alignment method, called Best-of-N, is as effective as the state-of-the-art post-training procedures. Unfortunately, Best-of-N requires vastly more resources at inference time than standard decoding strategies, which makes it computationally not viable. In this work, we introduce Speculative Rejection, a computationally-viable inference-time alignment algorithm. It generates high-scoring responses according to a given reward model, like Best-of-N does, while being between 16 to 32 times more computationally efficient.

cs.CL↗

arXiv2024

Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning

Large Language Models (LLMs) often memorize sensitive, private, or copyrighted data during pre-training. LLM unlearning aims to eliminate the influence of undesirable data from the pre-trained model while preserving the model's utilities on other tasks. Several practical methods have recently been proposed for LLM unlearning, mostly based on gradient ascent (GA) on the loss of undesirable data. However, on certain unlearning tasks, these methods either fail to effectively unlearn the target data or suffer from catastrophic collapse -- a drastic degradation of the model's utilities. In this paper, we propose Negative Preference Optimization (NPO), a simple alignment-inspired method that could efficiently and effectively unlearn a target dataset. We theoretically show that the progression toward catastrophic collapse by minimizing the NPO loss is exponentially slower than GA. Through experiments on synthetic data and the benchmark TOFU dataset, we demonstrate that NPO-based methods achieve a better balance between unlearning the undesirable data and maintaining the model's utilities. We also observe that NPO-based methods generate more sensible outputs than GA-based methods, whose outputs are often gibberish. Remarkably, on TOFU, NPO-based methods are the first to achieve reasonable unlearning results in forgetting 50% (or more) of the training data, whereas existing methods already struggle with forgetting 10% of training data.

cs.LG↗

arXiv2024

Detecting unfaithful entanglement by multiple fidelities

Certifying entanglement for unknown quantum states experimentally is a fundamental problem in quantum computing and quantum physics. Because of being easy to implement, a most popular approach for this problem in modern quantum experiments is detecting target quantum states with fidelity-based entanglement witnesses. Specifically, if the fidelity between a target state and an entangled pure state exceeds a certain value, the target state can be guaranteed to be entangled. Recently, however, it has been realized that there exist so-called unfaithful quantum states, which can be entangled, but their entanglement cannot be certified by any fidelity-based entanglement witnesses. In this paper, by specific examples we show that if one makes a slight modification to fidelity-based entanglement witnesses by combining multiple fidelities together, it is still possible to certify entanglement for unfaithful quantum states with this popular technique. Particularly, we will analyze the mathematical structure of the modified entanglement witnesses, and propose an algorithm that can search for the optimal designs for them.

quant-ph↗

arXiv2024

Multi-Agent Reinforcement Learning for Autonomous Driving: A Survey

Reinforcement Learning (RL) is a potent tool for sequential decision-making and has achieved performance surpassing human capabilities across many challenging real-world tasks. As the extension of RL in the multi-agent system domain, multi-agent RL (MARL) not only need to learn the control policy but also requires consideration regarding interactions with all other agents in the environment, mutual influences among different system components, and the distribution of computational resources. This augments the complexity of algorithmic design and poses higher requirements on computational resources. Simultaneously, simulators are crucial to obtain realistic data, which is the fundamentals of RL. In this paper, we first propose a series of metrics of simulators and summarize the features of existing benchmarks. Second, to ease comprehension, we recall the foundational knowledge and then synthesize the recently advanced studies of MARL-related autonomous driving and intelligent transportation systems. Specifically, we examine their environmental modeling, state representation, perception units, and algorithm design. Conclusively, we discuss open challenges as well as prospects and opportunities. We hope this paper can help the researchers integrate MARL technologies and trigger more insightful ideas toward the intelligent and autonomous driving.

cs.AI↗

arXiv2024

First-principles phase diagram of an interacting ionic chain

The widely-used Kohn-Sham implementation of density functional theory (DFT) maps a system of interacting electrons onto an auxiliary non-interacting one and is presumably inaccurate for strongly correlated materials. We present a concrete benchmark for DFT by examining the electronic ground state phase diagram of a strongly interacting chain with uneven, non-integer nuclear charges. The interplay between charge imbalance and Coulomb repulsion yields two competing phases, a band insulator and a Mott insulator. By including infinitesimal lattice distortions, DFT stabilizes the intermediate spontaneously dimerized insulator phase that results from this competition. We assess the phase diagram by mapping the bond length and nuclear charge ratio of the chain to the ionic Hubbard model and performing highly accurate density matrix renormalization group calculations. Our comparative study provides foundational insight into the utility of symmetry-broken DFT as a predictive tool for elucidating phase diagrams with competing orders.

cond-mat.str-el↗

arXiv2024

Second Dome of Superconductivity in YBa$_2$Cu$_3$O$_7$ at High Pressure

Evidence is growing that a second dome of high-$T_\mathrm{c}$ superconductivity can be accessed in the cuprates by increasing the doping beyond the first dome. Here we use \emph{ab initio} methods without invoking any free parameters, such as the Hubbard $U$, to reveal that pressure could turn YBa$_2$Cu$_3$O$_7$ into an ideal candidate for second-dome-superconductivity, displaying the predicted signature of strongly hybridized $d_{x^2-y^2}$ and $d_{z^2}$ orbitals. Notably, pressure is found to induce a phase transition replacing the antiferromagnetic phases with an orbitally-degenerate $d$--$d$ phase. Our study suggests that the origin of the second dome is correlated with the oxygen-hole fraction in the CuO$_2$ planes and the collapse of the pseudogap phase.

cond-mat.supr-con↗

arXiv2024

Is Offline Decision Making Possible with Only Few Samples? Reliable Decisions in Data-Starved Bandits via Trust Region Enhancement

What can an agent learn in a stochastic Multi-Armed Bandit (MAB) problem from a dataset that contains just a single sample for each arm? Surprisingly, in this work, we demonstrate that even in such a data-starved setting it may still be possible to find a policy competitive with the optimal one. This paves the way to reliable decision-making in settings where critical decisions must be made by relying only on a handful of samples. Our analysis reveals that \emph{stochastic policies can be substantially better} than deterministic ones for offline decision-making. Focusing on offline multi-armed bandits, we design an algorithm called Trust Region of Uncertainty for Stochastic policy enhancemenT (TRUST) which is quite different from the predominant value-based lower confidence bound approach. Its design is enabled by localization laws, critical radii, and relative pessimism. We prove that its sample complexity is comparable to that of LCB on minimax problems while being substantially lower on problems with very few samples. Finally, we consider an application to offline reinforcement learning in the special case where the logging policies are known.

cs.LG↗