arXiv subjects

Chen Qiu

Publications and source records attributed to Chen Qiu.

At least 37 records · Page 2Linked to original sources

arXiv2025

Approximate Least-Favorable Distributions and Nearly Optimal Tests via Stochastic Mirror Descent

We consider a class of hypothesis testing problems where the null hypothesis postulates $M$ distributions for the observed data, and there is only one possible distribution under the alternative. We show that one can use a stochastic mirror descent routine for convex optimization to provably obtain - after finitely many iterations - both an approximate least-favorable distribution and a nearly optimal test, in a sense we make precise. Our theoretical results yield concrete recommendations about the algorithm's implementation, including its initial condition, its step size, and the number of iterations. Importantly, our suggested algorithm can be viewed as a slight variation of the algorithm suggested by Elliott, Müller, and Watson (2015), whose theoretical performance guarantees are unknown.

econ.EM↗

arXiv2025

Effect of Concentration Fluctuations on Material Properties of Disordered Alloys

Alloying compound AX with another compound BX is widely used to tune material properties. For disordered alloys, due to the lack of periodicity, it has been challenging to calculate and study their material properties. Special quasi-random structure (SQS) method has been developed and widely used to treat this issue by matching averaged atomic correlation functions to those of ideal random alloys, enabling accurate predictions of macroscopic material properties such as total energy and volume. However, in AxB1-x alloys, statistically allowed local concentration fluctuations can give rise to defect-like minority configurations, such as bulk-like AX or BX regions in the extreme, which could strongly affect calculation of some of the material properties such as semiconductor bandgap, if it is not defined properly, leading to significant discrepancies between theory and experiment. In this work, taking the bandgap as an example, we demonstrate that the calculated alloy bandgap can be significantly underestimated in standard SQS calculations when the SQS cell size is increased to improve the structural model and the bandgap is defined conventionally as the energy difference between the lowest unoccupied state and the highest occupied state, because the rare event motifs can lead to wavefunction localization and become the dominant factor in determining the "bandgap", contrary to experiment. To be consistent with experiment, we show that the bandgap of the alloy should be extracted from the majority configurations using a density-of-states fitting (DOSF) method. This DOSF approach resolves the long-standing issue of calculating electronic structure of disordered semiconductor alloys. Similar approaches should also be developed to treat material properties that depends on localized alloy wavefunctions.

cond-mat.mtrl-sci↗

arXiv2025

Visual Self-Refinement for Autoregressive Models

Autoregressive models excel in sequential modeling and have proven to be effective for vision-language data. However, the spatial nature of visual signals conflicts with the sequential dependencies of next-token prediction, leading to suboptimal results. This work proposes a plug-and-play refinement module to enhance the complex spatial correspondence modeling within the generated visual sequence. This module operates as a post-pretraining step to jointly refine all generated tokens of autoregressive model, enhancing vision-language modeling under a shared sequential prediction framework. By leveraging global context and relationship across the tokens, our method mitigates the error accumulation issue within the sequential generation. Experiments demonstrate that the proposed method improves the generation quality, enhancing the model's ability to produce semantically consistent results.

cs.CV↗

arXiv2025

Experimental realization of dice-lattice flat band at the Fermi level in layered electride YCl

Flat electronic bands, where interactions among electrons overwhelm their kinetic energies, hold the promise for exotic correlation physics. The dice lattice has long been theorized as a host of flat bands with intriguing band topology. However, to date, no material has ever been found to host the characteristic flat bands of a dice lattice. Here, using angle-resolved photoemission spectroscopy (ARPES), we discover a dice-lattice flat band at $E_F$ in the van der Waals (vdW) electride [YCl]$^{2+}$: 2e-. In this system, excess valence electrons from Y deconfine from the cation framework to form an interstitial anionic electron lattice that constitutes the dice lattice. Our ARPES measurements unambiguously identify two sets of dice-lattice bands in YCl, including a nearly dispersionless band at the Fermi level. The flat bands and other dispersive bands observed in ARPES find excellent agreement with first-principles calculations, and theoretical analysis reveals that the near-$E_F$ electronic structure is well captured by a simple dice-lattice model. Our findings thus end the long quest of a real dice flat band material and establish vdW electride YCl as a prototype of dice metals. Our results further demonstrate the anionic electron lattice as a novel scheme for realizing lattice geometries and electronic structures rare to find in conventional crystalline systems.

cond-mat.str-el↗

arXiv2025

Decision Theory for Treatment Choice Problems with Partial Identification

We apply classical statistical decision theory to a large class of treatment choice problems with partial identification. We show that, in a general class of problems with Gaussian likelihood, all decision rules are admissible; it is maximin-welfare optimal to ignore all data; and, for severe enough partial identification, there are infinitely many minimax-regret optimal decision rules, all of which sometimes randomize the policy recommendation. We uniquely characterize the minimax-regret optimal rule that least frequently randomizes, and show that, in some cases, it can outperform other minimax-regret optimal rules in terms of what we term profiled regret. We analyze the implications of our results in the aggregation of experimental estimates for policy adoption, extrapolation of Local Average Treatment Effects, and policy making in the presence of omitted variable bias.

econ.EM↗

arXiv2025

Mechanism of $E'_γ$ Defect Generation in Ionizing-irradiated $a$-SiO$_2$: The Nonradiative Carrier Capture-Structural Relaxation Model

The total ionizing dose (TID) effect of semiconductor devices stems from radiation-induced $E'_γ$ defects in the $a$-SiO$_2$ dielectrics, but the conventional ``hole transport-trapping'' model of defect generation fails to explain recent basic experiments. Here, we propose an essentially new ``nonradiative carrier capture-structural relaxation'' (NCCSR) mechanism that can consistently explain the puzzling temperature/electric-field dependence, based on spin-polarized HSE06 hybrid functional calculations and existing experimental alignment of defect formation energies and charge capture cross-sections of large-sample oxygen vacancies in $a$-SiO$_2$. It is revealed that, the long-assumed $V_{Oγ}$ precursors with high formation energy cannot survive in high temperature-grown $a$-SiO$_2$; whereas the stable $V_{Oδ}$ can capture irradiation-induced holes via strong electron-phonon coupling, generating metastable $E'_δ$ that most relax into stable $E'_γ$. A fractional power-law (FPL) dynamic model is derived based on the mechanism and the Kohlrausch-Williams Watts (KWW) decay function. It can uniformly describe nonlinear data over a wide dose and temperature range. This work not only provides a solid cornerstone for prediction and hardening of TID effects of SiO$_2$-based semiconductor devices, but also offers a general approach for studying ionizing radiation physics in alternative dielectrics with intrinsic electronic metastability and dispersion.

cond-mat.mtrl-sci↗

arXiv2024

Is p-type doping in TeO2 feasible?

Wide-bandgap two-dimensional (2D) beta-TeO2 has been reported as a high-mobility p-type transparent semiconductor (Nat. Electron. 2021, 4, 277-283), attracting significant attention. This "breakthrough" not only challenges the conventional characterization of TeO2 as an insulator but also conflicts with the anticipated difficulty in hole doping of TeO2 by established chemical trends. Notably, the reported Fermi level of 0.9 eV above the valence band maximum (VBM) actually suggests that the material is an insulator, contradicting the high hole density obtained by Hall effect measurement. Furthermore, the detected residual Se and the possible reduced elemental Te in the 2D beta-TeO2 samples introduces complexity, considering that elemental Se, Te, and Te1-xSex themselves are high-mobility p-type semiconductor. Therefore, doubts regarding the true cause of the p-type conductivity observed in the 2D beta-TeO2 samples arise. In this work, we employ density functional theory calculations to illustrate that TeO2, whether in its bulk forms of alpha-, beta-, or gamma-TeO2, or in 2D beta-TeO2, inherently exhibits insulating properties and poses challenges in carrier doping due to its shallow conduction band minimum and deep valence band maximum (VBM). Our findings shed light on the insulating electrical properties and doping difficulty of TeO2, contrasting with the claimed p-type conductivity in the 2D beta-TeO2 samples, prompting inquiries into the true origin of the p-type conductivity.

cond-mat.mtrl-sci↗

arXiv2024

Reference Signal-Based Waveform Design for Integrated Sensing and Communications System

Integrated sensing and communications (ISAC) as one of the key technologies is capable of supporting high-speed communication and high-precision sensing for the upcoming 6G. This paper studies a waveform strategy by designing the orthogonal frequency division multiplexing (OFDM)-based reference signal (RS) for sensing and communication in ISAC system. We derive the closed-form expressions of Cramér-Rao Bound (CRB) for the distance and velocity estimations, and obtain the communication rate under the mean square error of channel estimation. Then, a weighted sum CRB minimization problem on the distance and velocity estimations is formulated by considering communication rate requirement and RS intervals constraints, which is a mixed-integer problem due to the discrete RS interval values. To solve this problem, some numerical methods are typically adopted to obtain the optimal solutions, whose computational complexity grow exponentially with the number of symbols and subcarriers of OFDM. Therefore, we propose a relaxation and approximation method to transform the original discrete problem into a continuous convex one and obtain the sub-optimal solutions. Finally, our proposed scheme is compared with the exhaustive search method in numerical simulations, which show slight gap between the obtained sub-optimal and optimal solutions, and this gap further decreases with large weight factor.

eess.SP↗

arXiv2024

Combining Counterfactual Regret Minimization with Information Gain to Solve Extensive Games with Unknown Environments

Counterfactual regret minimization (CFR) is an effective algorithm for solving extensive games with imperfect information (IIEGs). However, CFR is only allowed to be applied in known environments, where the transition function of the chance player and the reward function of the terminal node in IIEGs are known. In uncertain situations, such as reinforcement learning (RL) problems, CFR is not applicable. Thus, applying CFR in unknown environments is a significant challenge that can also address some difficulties in the real world. Currently, advanced solutions require more interactions with the environment and are limited by large single-sampling variances to narrow the gap with the real environment. In this paper, we propose a method that combines CFR with information gain to compute the Nash equilibrium (NE) of IIEGs with unknown environments. We use a curiosity-driven approach to explore unknown environments and minimize the discrepancy between uncertain and real environments. Additionally, by incorporating information into the reward, the average strategy calculated by CFR can be directly implemented as the interaction policy with the environment, thereby improving the exploration efficiency of our method in uncertain environments. Through experiments on standard testbeds such as Kuhn poker and Leduc poker, our method significantly reduces the number of interactions with the environment compared to the different baselines and computes a more accurate approximate NE within the same number of interaction rounds.

cs.GT↗

arXiv2024

Treatment Choice with Nonlinear Regret

The literature focuses on the mean of welfare regret, which can lead to undesirable treatment choice due to sensitivity to sampling uncertainty. We propose to minimize the mean of a nonlinear transformation of regret and show that singleton rules are not essentially complete for nonlinear regret. Focusing on mean square regret, we derive closed-form fractions for finite-sample Bayes and minimax optimal rules. Our approach is grounded in decision theory and extends to limit experiments. The treatment fractions can be viewed as the strength of evidence favoring treatment. We apply our framework to a normal regression model and sample size calculation.

econ.EM↗

arXiv2024

Model Selection of Anomaly Detectors in the Absence of Labeled Validation Data

Anomaly detection is the task of identifying abnormal samples in large unlabeled datasets. While the advent of foundation models has produced powerful zero-shot anomaly detection methods, their deployment in practice is often hindered by the absence of labeled validation data -- without it, their detection performance cannot be evaluated reliably. In this work, we propose SWSA (Selection With Synthetic Anomalies): a general-purpose framework to select image-based anomaly detectors without labeled validation data. Instead of collecting labeled validation data, we generate synthetic anomalies without any training or fine-tuning, using only a small support set of normal images. Our synthetic anomalies are used to create detection tasks that compose a validation framework for model selection. In an empirical study, we evaluate SWSA with three types of synthetic anomalies and on two selection tasks: model selection of image-based anomaly detectors and prompt selection for CLIP-based anomaly detection. SWSA often selects models and prompts that match selections made with a ground-truth validation set, outperforming baseline selection strategies.

cs.LG↗

arXiv2024

Enhanced Equilibria-Solving via Private Information Pre-Branch Structure in Adversarial Team Games

In ex ante coordinated adversarial team games (ATGs), a team competes against an adversary, and the team members are only allowed to coordinate their strategies before the game starts. The team-maxmin equilibrium with correlation (TMECor) is a suitable solution concept for ATGs. One class of TMECor-solving methods transforms the problem into solving NE in two-player zero-sum games, leveraging well-established tools for the latter. However, existing methods are fundamentally action-based, resulting in poor generalizability and low solving efficiency due to the exponential growth in the size of the transformed game. To address the above issues, we propose an efficient game transformation method based on private information, where all team members are represented by a single coordinator. We designed a structure called private information pre-branch, which makes decisions considering all possible private information from teammates. We prove that the size of the game transformed by our method is exponentially reduced compared to the current state-of-the-art. Moreover, we demonstrate equilibria equivalence. Experimentally, our method achieves a significant speedup of 182.89$\times$ to 694.44$\times$ in scenarios where the current state-of-the-art method can work, such as small-scale Kuhn poker and Leduc poker. Furthermore, our method is applicable to larger games and those with dynamically changing private information, such as Goofspiel.

cs.GT↗

arXiv2024

Anomaly Detection of Tabular Data Using LLMs

Large language models (LLMs) have shown their potential in long-context understanding and mathematical reasoning. In this paper, we study the problem of using LLMs to detect tabular anomalies and show that pre-trained LLMs are zero-shot batch-level anomaly detectors. That is, without extra distribution-specific model fitting, they can discover hidden outliers in a batch of data, demonstrating their ability to identify low-density data regions. For LLMs that are not well aligned with anomaly detection and frequently output factual errors, we apply simple yet effective data-generating processes to simulate synthetic batch-level anomaly detection datasets and propose an end-to-end fine-tuning strategy to bring out the potential of LLMs in detecting real anomalies. Experiments on a large anomaly detection benchmark (ODDS) showcase i) GPT-4 has on-par performance with the state-of-the-art transductive learning-based anomaly detection methods and ii) the efficacy of our synthetic dataset and fine-tuning strategy in aligning LLMs to this task.

cs.LG↗

arXiv2024

Uncertainty-aware Evaluation of Auxiliary Anomalies with the Expected Anomaly Posterior

Anomaly detection is the task of identifying examples that do not behave as expected. Because anomalies are rare and unexpected events, collecting real anomalous examples is often challenging in several applications. In addition, learning an anomaly detector with limited (or no) anomalies often yields poor prediction performance. One option is to employ auxiliary synthetic anomalies to improve the model training. However, synthetic anomalies may be of poor quality: anomalies that are unrealistic or indistinguishable from normal samples may deteriorate the detector's performance. Unfortunately, no existing methods quantify the quality of auxiliary anomalies. We fill in this gap and propose the expected anomaly posterior (EAP), an uncertainty-based score function that measures the quality of auxiliary anomalies by quantifying the total uncertainty of an anomaly detector. Experimentally on 40 benchmark datasets of images and tabular data, we show that EAP outperforms 12 adapted data quality estimators in the majority of cases.

cs.LG↗

arXiv2024

Recursive expansion of Tanner graph: a method to construct stabilizer codes with high coding rate

Quantum stabilizer codes face the problem of low coding rate. In this article, following the idea of recursively expanding Tanner graph proposed in our previous work, we try to construct new stabilizer codes with high coding rate, and propose XZ-type Tanner-graph-recursive-expansion (XZ-TGRE) code and Tanner-graph-recursive-expansion hypergraph product (TGRE-HP) code. XZ-TGRE code have zero asymptotic coding rate, but its coding rate tends to zero extremely slowly with the growth of code length. Under the same code length, its coding rate is much higher than that of surface code. The coding rate of TGRE-HP is the constant 0.2, which is the highest constant coding rate of stabilizer codes to our best knowledge. We prove that the code distance of XZ-TGRE code scales as $O(log(N))$, and that of TGRE-HP code scales as $O(\log \sqrt{N})$, where $N$ is the code length. Moreover, the code capacity noise threshold of XZ-TGRE code is around 0.078, and that of TGRE-HP code is around 0.096. This articles shows that the idea of recursively expanding Tanner graph might have potential to construct quantum codes with good performance.

quant-ph↗

arXiv2024

Determining the upper bound of code distance of quantum stabilizer codes through Monte Carlo method based on fully decoupled belief propagation

Code distance is an important parameter for quantum stabilizer codes (QSCs). Directly precisely computing it is an NP-complete problem. However, the upper bound of code distance can be computed by some efficient methods. In this paper, employing the idea of Monte Carlo method, we propose the algorithm of determining the upper bound of code distance of QSCs based on fully decoupled belief propagation. Our algorithm shows high precision - the upper bound of code distance determined by the algorithm of a variety of QSCs whose code distance is known is consistent with actual code distance. Besides, we explore the upper bound of logical X operators of Z-type Tanner-graph-recursive-expansion (Z-TGRE) code and Chamon code, which is a kind of XYZ product code constructed by three repetition codes. The former is consistent with the theoretical analysis, and the latter implies the code distance of XYZ product codes can very likely achieve $O(N^{2/3})$, which supports the conjecture of Leverrier et al..

quant-ph↗

arXiv2024

The Role of Data Curation in Image Captioning

Image captioning models are typically trained by treating all samples equally, neglecting to account for mismatched or otherwise difficult data points. In contrast, recent work has shown the effectiveness of training models by scheduling the data using curriculum learning strategies. This paper contributes to this direction by actively curating difficult samples in datasets without increasing the total number of samples. We explore the effect of using three data curation methods within the training process: complete removal of an sample, caption replacement, or image replacement via a text-to-image generation model. Experiments on the Flickr30K and COCO datasets with the BLIP and BEiT-3 models demonstrate that these curation methods do indeed yield improved image captioning models, underscoring their efficacy.

cs.CV↗

arXiv2023

Feasibility Conditions for Mobile LiFi

Light fidelity (LiFi) is a potential key technology for future 6G networks. However, its feasibility of supporting mobile communications has not been fundamentally discussed. In this paper, we investigate the time-varying channel characteristics of mobile LiFi based on measured mobile phone rotation and movement data. Specifically, we define LiFi channel coherence time to evaluate the correlation of the channel timing sequence. Then, we derive the expression of LiFi transmission rate based on the m-pulse-amplitude-modulation (M-PAM). The derived rate expression indicates that mobile LiFi communications is feasible by using at least two photodiodes (PDs) with different orientations. Further, we propose two channel estimation schemes, and propose a LiFi channel tracking scheme to improve the communication performance. Finally, our experimental results show that the channel coherence time is on the order of tens of milliseconds, which indicates a relatively stable channel. In addition, based on the measured data, better communication performance can be realized in the multiple-input multiple-output (MIMO) scenario with a rate of 36Mbit/s, compared to other scenarios. The results also show that the proposed channel estimation and tracking schemes are effective in designing mobile LiFi systems.

eess.SY↗