Searcharxiv⌕ Search

arXiv subjects

Yubo Zhang

Publications and source records attributed to Yubo Zhang.

At least 55 records · Page 3Linked to original sources
arXiv2024

Planckian Diffusion: The Ghost of Anderson Localization

We find that Anderson localization ceases to exist when a random medium begins to move, but another type of fundamental quantum effect, Planckian diffusion $D = α\hbar/m$, rises to replace it, with $α$ of order of unity. Planckian diffusion supercedes the Planckian speed limit $τ= α\hbar/k_B T,$ as it not only implies this relation in thermal systems but also applies more generally without requiring thermal equilibrium. Here we model a dynamic disordered system with thousands of itinerant impurities, having random initial positions and velocities. By incrementally increasing their speed from zero, we observe a transition from Anderson localization to Planckian diffusion, with $α$ falling within the range of $0.5$ to $2$. Furthermore, we relate the breakdown of Anderson localization to three additional, distinctly different confirming cases that also exhibit Planckian diffusion $D\sim \hbar/m$, including one experiment on solid hydrogen. Our finding suggests that Planckian diffusion in dynamic disordered systems is as universal as Anderson localization in static disordered systems, which may shed light on quantum transport studies.

quant-ph↗
arXiv2024

CLIMB: A Benchmark of Clinical Bias in Large Language Models

Large language models (LLMs) are increasingly applied to clinical decision-making. However, their potential to exhibit bias poses significant risks to clinical equity. Currently, there is a lack of benchmarks that systematically evaluate such clinical bias in LLMs. While in downstream tasks, some biases of LLMs can be avoided such as by instructing the model to answer "I'm not sure...", the internal bias hidden within the model still lacks deep studies. We introduce CLIMB (shorthand for A Benchmark of Clinical Bias in Large Language Models), a pioneering comprehensive benchmark to evaluate both intrinsic (within LLMs) and extrinsic (on downstream tasks) bias in LLMs for clinical decision tasks. Notably, for intrinsic bias, we introduce a novel metric, AssocMAD, to assess the disparities of LLMs across multiple demographic groups. Additionally, we leverage counterfactual intervention to evaluate extrinsic bias in a task of clinical diagnosis prediction. Our experiments across popular and medically adapted LLMs, particularly from the Mistral and LLaMA families, unveil prevalent behaviors with both intrinsic and extrinsic bias. This work underscores the critical need to mitigate clinical bias and sets a new standard for future evaluations of LLMs' clinical bias.

cs.CL↗
arXiv2024

Accurate DFT Simulation of Complex Functional Materials: Synergistic Enhancements Achieved by SCAN meta-GGA

Complex functional materials are characterized by intricate and competing bond orders, making them an excellent platform for evaluating the newly developed Strongly Constrained and Appropriately Normed (SCAN) density functional. In this study, we explore the effectiveness of SCAN in simulating the electronic properties of displacive ferroelectrics (BaTiO3 and PbTiO3) and magnetoelectric multiferroics (BiFeO3 and YMnO3), which encompass a broad spectrum of bonding characteristics. Due to a significant reduction in self-interaction error, SCAN manifests its improvements over the Perdew-Burke-Ernzerhof (PBE) method in three aspects: SCAN produces more compact orbitals, predicts more accurate ionicity, and better captures orbital anisotropy. Particularly, these synergistic enhancements lead to notable phenomena in calculating the bandgap of YMnO3: while the PBE+U simulation may suggest a strong correlation appearance attributed to high Hubbard-like U values (~5 eV), the value is dramatically lower (~1 eV) in the SCAN+U method. Furthermore, we provide an intuitive analysis of SCAN's operational principles by examining the complex electron densities involved. These insights are theoretically intriguing and have practical implications, potentially encouraging wider adoption of SCAN in the computational modeling of complex functional materials.

cond-mat.mtrl-sci↗
arXiv2024

Strategic Chain-of-Thought: Guiding Accurate Reasoning in LLMs through Strategy Elicitation

The Chain-of-Thought (CoT) paradigm has emerged as a critical approach for enhancing the reasoning capabilities of large language models (LLMs). However, despite their widespread adoption and success, CoT methods often exhibit instability due to their inability to consistently ensure the quality of generated reasoning paths, leading to sub-optimal reasoning performance. To address this challenge, we propose the \textbf{Strategic Chain-of-Thought} (SCoT), a novel methodology designed to refine LLM performance by integrating strategic knowledge prior to generating intermediate reasoning steps. SCoT employs a two-stage approach within a single prompt: first eliciting an effective problem-solving strategy, which is then used to guide the generation of high-quality CoT paths and final answers. Our experiments across eight challenging reasoning datasets demonstrate significant improvements, including a 21.05\% increase on the GSM8K dataset and 24.13\% on the Tracking\_Objects dataset, respectively, using the Llama3-8b model. Additionally, we extend the SCoT framework to develop a few-shot method with automatically matched demonstrations, yielding even stronger results. These findings underscore the efficacy of SCoT, highlighting its potential to substantially enhance LLM performance in complex reasoning tasks.

cs.AI↗
arXiv2024

Towards Automated Data Sciences with Natural Language and SageCopilot: Practices and Lessons Learned

While the field of NL2SQL has made significant advancements in translating natural language instructions into executable SQL scripts for data querying and processing, achieving full automation within the broader data science pipeline - encompassing data querying, analysis, visualization, and reporting - remains a complex challenge. This study introduces SageCopilot, an advanced, industry-grade system system that automates the data science pipeline by integrating Large Language Models (LLMs), Autonomous Agents (AutoAgents), and Language User Interfaces (LUIs). Specifically, SageCopilot incorporates a two-phase design: an online component refining users' inputs into executable scripts through In-Context Learning (ICL) and running the scripts for results reporting & visualization, and an offline preparing demonstrations requested by ICL in the online phase. A list of trending strategies such as Chain-of-Thought and prompt-tuning have been used to augment SageCopilot for enhanced performance. Through rigorous testing and comparative analysis against prompt-based solutions, SageCopilot has been empirically validated to achieve superior end-to-end performance in generating or executing scripts and offering results with visualization, backed by real-world datasets. Our in-depth ablation studies highlight the individual contributions of various components and strategies used by SageCopilot to the end-to-end correctness for data sciences.

cs.AI↗
arXiv2024

Coresets for Kernel Clustering

We devise coresets for kernel $k$-Means with a general kernel, and use them to obtain new, more efficient, algorithms. Kernel $k$-Means has superior clustering capability compared to classical $k$-Means, particularly when clusters are non-linearly separable, but it also introduces significant computational challenges. We address this computational issue by constructing a coreset, which is a reduced dataset that accurately preserves the clustering costs. Our main result is a coreset for kernel $k$-Means that works for a general kernel and has size $\mathrm{poly}(kε^{-1})$. Our new coreset both generalizes and greatly improves all previous results; moreover, it can be constructed in time near-linear in $n$. This result immediately implies new algorithms for kernel $k$-Means, such as a $(1+ε)$-approximation in time near-linear in $n$, and a streaming algorithm using space and update time $\mathrm{poly}(k ε^{-1} \log n)$. We validate our coreset on various datasets with different kernels. Our coreset performs consistently well, achieving small errors while using very few points. We show that our coresets can speed up kernel $k$-Means++ (the kernelized version of the widely used $k$-Means++ algorithm), and we further use this faster kernel $k$-Means++ for spectral clustering. In both applications, we achieve significant speedup and a better asymptotic growth while the error is comparable to baselines that do not use coresets.

cs.DS↗
arXiv2023

Contrastive Prompt Learning-based Code Search based on Interaction Matrix

Code search aims to retrieve the code snippet that highly matches the given query described in natural language. Recently, many code pre-training approaches have demonstrated impressive performance on code search. However, existing code search methods still suffer from two performance constraints: inadequate semantic representation and the semantic gap between natural language (NL) and programming language (PL). In this paper, we propose CPLCS, a contrastive prompt learning-based code search method based on the cross-modal interaction mechanism. CPLCS comprises:(1) PL-NL contrastive learning, which learns the semantic matching relationship between PL and NL representations; (2) a prompt learning design for a dual-encoder structure that can alleviate the problem of inadequate semantic representation; (3) a cross-modal interaction mechanism to enhance the fine-grained mapping between NL and PL. We conduct extensive experiments to evaluate the effectiveness of our approach on a real-world dataset across six programming languages. The experiment results demonstrate the efficacy of our approach in improving semantic representation quality and mapping ability between PL and NL.

cs.SE↗
arXiv2023

Challenges for density functional theory in simulating metal-metal singlet bonding: a case study of dimerized VO2

VO2 is renowned for its electric transition from an insulating monoclinic (M1) phase characterized by V-V dimerized structures, to a metallic rutile (R) phase above 340 Kelvin. This transition is accompanied by a magnetic change: the M1 phase exhibits a non-magnetic spin-singlet state, while the R phase exhibits a state with local magnetic moments. Simultaneous simulation of the structural, electric, and magnetic properties of this compound is of fundamental importance, but the M1 phase alone has posed a significant challenge to density functional theory (DFT). In this study, we show none of the commonly used DFT functionals, including those combined with on-site Hubbard U to better treat 3d electrons, can accurately predict the V-V dimer length. The spin-restricted method tends to overestimate the strength of the V-V bonds, resulting in a small V-V bond length. Conversely, the spin-symmetry-breaking method exhibits the opposite trends. Each bond-calculation method underscores one of the two contentious mechanisms, i.e., Peierls or Mott, involved in the metal-insulator transition in VO2. To elucidate the challenges encountered in DFT, we also employ an effective Hamiltonian that integrates one-dimensional magnetic sites, thereby revealing the inherent difficulties linked with the DFT computations.

cond-mat.mtrl-sci↗
arXiv2023

Algorithms for the Generalized Poset Sorting Problem

We consider a generalized poset sorting problem (GPS), in which we are given a query graph $G = (V, E)$ and an unknown poset $\mathcal{P}(V, \prec)$ that is defined on the same vertex set $V$, and the goal is to make as few queries as possible to edges in $G$ in order to fully recover $\mathcal{P}$, where each query $(u, v)$ returns the relation between $u, v$, i.e., $u \prec v$, $v \prec u$ or $u \not \sim v$. This generalizes both the poset sorting problem [Faigle et al., SICOMP 88] and the generalized sorting problem [Huang et al., FOCS 11]. We give algorithms with $\tilde{O}(n\cdot \mathrm{poly}(k))$ query complexity when $G$ is a complete bipartite graph or $G$ is stochastic under the \ER model, where $k$ is the \emph{width} of the poset, and these generalize [Daskalakis et al., SICOMP 11] which only studies complete graph $G$. Both results are based on a unified framework that reduces the poset sorting to partitioning the vertices with respect to a given pivot element, which may be of independent interest. Our study of GPS also leads to a new $\tilde{O}(n^{1 - 1 / (2W)})$ competitive ratio for the so-called weighted generalized sorting problem where $W$ is the number of distinct weights in the query graph. This problem was considered as an open question in [Charikar et al., JCSS 02], and our result makes important progress as it yields the first nontrivial sublinear ratio for general weighted query graphs (for any bounded $W$). We obtain this via an $\tilde{O}(nk + n^{1.5})$ query complexity algorithm for the case where every edge in $G$ is guaranteed to be comparable in the poset, which generalizes a $\tilde{O}(n^{1.5})$ bound for generalized sorting [Huang et al., FOCS 11].

cs.DS↗
arXiv2023

Channel Estimation and Signal Detection for NLOS Ultraviolet Scattering Communication with Space Division Multiple Access

We design a receiver assembling several photomultipliers (PMTs) as an array to increase the field of view (FOV) of the receiver and adapt to multiuser situation over None-line-of-sight (NLOS) ultraviolet (UV) channels. Channel estimation and signal detection have been investigated according to the space division characteristics of the structure. Firstly, we adopt the balanced structure on the pilot matrix, analyze the channel estimation mean square error (MSE), and optimize the structure parameters. Then, with the estimated parameters, an analytical threshold detection rule is proposed as a preliminary work of multiuser detection. The detection rule can be optimized by analyzing the separability of two users based on the Gaussian approximation of Poisson weighted sum. To assess the effect of imperfect estimation, the sensitivity analysis of channel estimation error on two-user signal detection is performed. Moreover, we propose a successive elimination method for on-off keying (OOK) modulated multiuser symbol detection based on the previous threshold detection rule. A closed-form upper bound on the detection error rate is calculated, which turns out to be a good approximation of that of multiuser maximum-likelihood (ML) detection. The proposed successive elimination method is twenty times faster than the ML detection with negligible detection error rate degradation.

cs.IT↗
arXiv2023

A Surface-normal Based Neural Framework for Colonoscopy Reconstruction

Reconstructing a 3D surface from colonoscopy video is challenging due to illumination and reflectivity variation in the video frame that can cause defective shape predictions. Aiming to overcome this challenge, we utilize the characteristics of surface normal vectors and develop a two-step neural framework that significantly improves the colonoscopy reconstruction quality. The normal-based depth initialization network trained with self-supervised normal consistency loss provides depth map initialization to the normal-depth refinement module, which utilizes the relationship between illumination and surface normals to refine the frame-wise normal and depth predictions recursively. Our framework's depth accuracy performance on phantom colonoscopy data demonstrates the value of exploiting the surface normals in colonoscopy reconstruction, especially on en face views. Due to its low depth error, the prediction result from our framework will require limited post-processing to be clinically applicable for real-time colonoscopy reconstruction.

cs.CV↗
arXiv2023

A Multi-level Alignment Training Scheme for Video-and-Language Grounding

To solve video-and-language grounding tasks, the key is for the network to understand the connection between the two modalities. For a pair of video and language description, their semantic relation is reflected by their encodings' similarity. A good multi-modality encoder should be able to well capture both inputs' semantics and encode them in the shared feature space where embedding distance gets properly translated into their semantic similarity. In this work, we focused on this semantic connection between video and language, and developed a multi-level alignment training scheme to directly shape the encoding process. Global and segment levels of video-language alignment pairs were designed, based on the information similarity ranging from high-level context to fine-grained semantics. The contrastive loss was used to contrast the encodings' similarities between the positive and negative alignment pairs, and to ensure the network is trained in such a way that similar information is encoded closely in the shared feature space while information of different semantics is kept apart. Our multi-level alignment training can be applied to various video-and-language grounding tasks. Together with the task-specific training loss, our framework achieved comparable performance to previous state-of-the-arts on multiple video QA and retrieval datasets.

cs.CV↗
arXiv2022

Critical role of magnetic moments on lattice dynamics in YBa${}_{2}$Cu${}_{3}$O${}_{6}$

The role of lattice dynamics in unconventional high-temperature superconductivity is still vigorously debated. Theoretical insights into this problem have long been prevented by the absence of an accurate first-principles description of the combined electronic, magnetic, and lattice degrees of freedom. Utilizing the recently constructed r$^2$SCAN density functional that stabilizes the antiferromagnetic (AFM) state of the pristine oxide YBa$_2$Cu$_3$O$_6$, we faithfully reproduce the experimental dispersion of key phonon modes. We further find significant magnetoelastic coupling in numerous high energy Cu-O bond stretching optical branches, where the AFM results improve over the soft non-magnetic phonon bands.

cond-mat.supr-con↗
arXiv2022

Latent Prompt Tuning for Text Summarization

Prompts with different control signals (e.g., length, keywords, etc.) can be used to control text summarization. When control signals are available, they can control the properties of generated summaries and potentially improve summarization quality (since more information are given). Unfortunately, control signals are not already available during inference time. In this paper, we propose Lotus (shorthand for Latent Prompt Tuning for Summarization), which is a single model that can be applied in both controlled and uncontrolled (without control signals) modes. During training, Lotus learns latent prompt representations from prompts with gold control signals using a contrastive learning objective. Experiments show Lotus in uncontrolled mode consistently improves upon strong (uncontrollable) summarization models across four different summarization datasets. We also demonstrate generated summaries can be controlled using prompts with user specified control tokens.

cs.CL↗
arXiv2022

UmeTrack: Unified multi-view end-to-end hand tracking for VR

Real-time tracking of 3D hand pose in world space is a challenging problem and plays an important role in VR interaction. Existing work in this space are limited to either producing root-relative (versus world space) 3D pose or rely on multiple stages such as generating heatmaps and kinematic optimization to obtain 3D pose. Moreover, the typical VR scenario, which involves multi-view tracking from wide \ac{fov} cameras is seldom addressed by these methods. In this paper, we present a unified end-to-end differentiable framework for multi-view, multi-frame hand tracking that directly predicts 3D hand pose in world space. We demonstrate the benefits of end-to-end differentiabilty by extending our framework with downstream tasks such as jitter reduction and pinch prediction. To demonstrate the efficacy of our model, we further present a new large-scale egocentric hand pose dataset that consists of both real and synthetic data. Experiments show that our system trained on this dataset handles various challenging interactive motions, and has been successfully applied to real-time VR applications.

cs.CV↗
arXiv2022

Eliciting Thinking Hierarchy without a Prior

When we use the wisdom of the crowds, we usually rank the answers according to their popularity, especially when we cannot verify the answers. However, this can be very dangerous when the majority make systematic mistakes. A fundamental question arises: can we build a hierarchy among the answers \textit{without any prior} where the higher-ranking answers, which may not be supported by the majority, are from more sophisticated people? To address the question, we propose 1) a novel model to describe people's thinking hierarchy; 2) two algorithms to learn the thinking hierarchy without any prior; 3) a novel open-response based crowdsourcing approach based on the above theoretic framework. In addition to theoretic justifications, we conduct four empirical crowdsourcing studies and show that a) the accuracy of the top-ranking answers learned by our approach is much higher than that of plurality voting (In one question, the plurality answer is supported by 74 respondents but the correct answer is only supported by 3 respondents. Our approach ranks the correct answer the highest without any prior); b) our model has a high goodness-of-fit, especially for the questions where our top-ranking answer is correct. To the best of our knowledge, we are the first to propose a thinking hierarchy model with empirical validations in the general problem-solving scenarios; and the first to propose a practical open-response based crowdsourcing approach that beats plurality voting without any prior.

cs.GT↗
arXiv2022

High-performance non-Fermi-liquid metallic thermoelectric materials

Searching for high-performance thermoelectric (TE) materials in the paradigm of narrow-bandgap semiconductors has lasted for nearly 70 years and is obviously hampered by a bottleneck of research now. Here we report on the discovery of a few metallic compounds, TiFexCu2x-1Sb and TiFe1.33Sb, showing the thermopower exceeding many TE semiconductors and the dimensionless figure of merits comparable with the state-of-the-art TE materials. A quasi-linear temperature (T) dependence of electrical resistivity in 2 K - 700 K and the logarithmic T-dependent electronic specific heat at low temperature are also observed to coexist with the high thermopower, highlighting the strong intercoupling of the non-Fermi-liquid (NFL) quantum critical behavior of electrons with TE transports. Electronic structure analysis reveals the existence of fluctuating Fe-eg-related local magnetic moments, Fe-Fe antiferromagnetic (AFM) interaction at the nearest 4c-4d sites, and two-fold degenerate eg orbitals antiferromagnetically coupled with the dual-type itinerant electrons close to the Fermi level, all of which infer to a competition between the AFM ordering and Kondo-like spin compensation as well as a parallel two-channel Kondo effect. These effects are both strongly meditated by the structural disorder due to the random filling of Fe/Cu at the equivalent 4c/4d sites of the Heusler crystal lattice. The magnetic susceptibility deviates from ideal antiferromagnetism but can be fitted well by x(T) = 1/(θ + BTα), seemingly being consistent with the quantum critical scenario of strong local correlation as discussed before. Our work not only breaks the dilemma that the promising TE materials should be heavily-doped semiconductors, but also demonstrates the correlation among high TE performance, NFL quantum criticality, and magnetic fluctuation, which opens up new directions for future research.

cond-mat.str-el↗
arXiv2022

Online Facility Location with Predictions

We provide nearly optimal algorithms for online facility location (OFL) with predictions. In OFL, $n$ demand points arrive in order and the algorithm must irrevocably assign each demand point to an open facility upon its arrival. The objective is to minimize the total connection costs from demand points to assigned facilities plus the facility opening cost. We further assume the algorithm is additionally given for each demand point $x_i$ a natural prediction $f_{x_i}^{\mathrm{pred}}$ which is supposed to be the facility $f_{x_i}^{\mathrm{opt}}$ that serves $x_i$ in the offline optimal solution. Our main result is an $O(\min\{\log {\frac{nη_\infty}{\mathrm{OPT}}}, \log{n} \})$-competitive algorithm where $η_\infty$ is the maximum prediction error (i.e., the distance between $f_{x_i}^{\mathrm{pred}}$ and $f_{x_i}^{\mathrm{opt}}$). Our algorithm overcomes the fundamental $Ω(\frac{\log n}{\log \log n})$ lower bound of OFL (without predictions) when $η_\infty$ is small, and it still maintains $O(\log n)$ ratio even when $η_\infty$ is unbounded. Furthermore, our theoretical analysis is supported by empirical evaluations for the tradeoffs between $η_\infty$ and the competitive ratio on various real datasets of different types.

cs.DS↗