arXiv subjects

Tianzi Ma

Publications and source records attributed to Tianzi Ma.

5 recordsLinked to original sources

arXiv2026

Collective Blinking of Upconversion Emission in Lanthanide-doped Nanocrystals

Fluorescence blinking, often regarded as a limitation for stable emitters, can enable super-resolution localization microscopy and serve as a versatile reporter of the photophysical states of quantum emitters and their interactions with local environment. However, conventional blinking emitters are typically single quantum systems with Stokes-shifted fluorescence, making them susceptible to autofluorescence background, weak signal, and irreversible photodegradation under prolonged excitation. In contrast, single lanthanide-doped upconversion nanocrystals are effectively background-free anti-Stokes emitters and demonstrate robust resistance to photodegradation, yet they are generally considered non-blinking owing to the presence of a large ensemble of uncorrelated emitting lanthanide ions within a single nanocrystal. Here we report the discovery and control of collective blinking in the upconversion luminescence of thousands of lanthanide ions within a single nanocrystal. The blinking exhibits on-off intensity ratio exceeding 10, persists for over 15 hours (over 10,000 cycles) without discernible photodegradation, and can be reversibly controlled by adjusting the excitation power. We elucidate a universal, activator-independent upconversion blinking mechanism, whereby a single quencher, stochastically generated via a cooperative multi-ion process, can intercept delocalized excitation energy within the Yb3+ sensitizer network and darken the whole nanocrystal. Benefiting from the high-contrast, long-term photostable blinking and background-free emission, we achieve robust super-resolution localization microscopy that resolves individual nanocrystals in aggregates with 1.2 nm precision. This work establishes a general strategy to realize and control collective blinking in photostable multi-emitter nanosystems, opening new opportunities in nanoscience, bioimaging, and quantum technologies.

physics.optics↗

arXiv2025

Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation

Regret minimization is a powerful method for finding Nash equilibria in Normal-Form Games (NFGs) and Extensive-Form Games (EFGs), but it typically guarantees convergence only for the average strategy. However, computing the average strategy requires significant computational resources or introduces additional errors, limiting its practical applicability. The Reward Transformation (RT) framework was introduced to regret minimization to achieve last-iterate convergence through reward function regularization. However, it faces practical challenges: its performance is highly sensitive to manually tuned parameters, which often deviate from theoretical convergence conditions, leading to slow convergence, oscillations, or stagnation in local optima. Inspired by previous work, we propose an adaptive technique to address these issues, ensuring better consistency between theoretical guarantees and practical performance for RT Regret Matching (RTRM), RT Counterfactual Regret Minimization (RTCFR), and their variants in solving NFGs and EFGs more effectively. Our adaptive methods dynamically adjust parameters, balancing exploration and exploitation while improving regret accumulation, ultimately enhancing asymptotic last-iterate convergence and achieving linear convergence. Experimental results demonstrate that our methods significantly accelerate convergence, outperforming state-of-the-art algorithms.

cs.GT↗

arXiv2025

Last-Iterate Convergence in Adaptive Regret Minimization for Approximate Extensive-Form Perfect Equilibrium

The Nash Equilibrium (NE) assumes rational play in imperfect-information Extensive-Form Games (EFGs) but fails to ensure optimal strategies for off-equilibrium branches of the game tree, potentially leading to suboptimal outcomes in practical settings. To address this, the Extensive-Form Perfect Equilibrium (EFPE), a refinement of NE, introduces controlled perturbations to model potential player errors. However, existing EFPE-finding algorithms, which typically rely on average strategy convergence and fixed perturbations, face significant limitations: computing average strategies incurs high computational costs and approximation errors, while fixed perturbations create a trade-off between NE approximation accuracy and the convergence rate of NE refinements. To tackle these challenges, we propose an efficient adaptive regret minimization algorithm for computing approximate EFPE, achieving last-iterate convergence in two-player zero-sum EFGs. Our approach introduces Reward Transformation Counterfactual Regret Minimization (RTCFR) to solve perturbed games and defines a novel metric, the Information Set Nash Equilibrium (ISNE), to dynamically adjust perturbations. Theoretical analysis confirms convergence to EFPE, and experimental results demonstrate that our method significantly outperforms state-of-the-art algorithms in both NE and EFPE-finding tasks.

cs.GT↗

arXiv2023

Bright nonblinking photoluminescence with blinking lifetime from a nanocavity-coupled quantum dot

Colloidal semiconductor quantum dots (QDs) are excellent luminescent nanomaterials for a broad range of optoelectronic applications. Their photoluminescence blinking, however, hinders their practical use in many aspects. It has been shown that coupling QDs to plasmonic nanostructures may provide a viable way to suppress blinking. Nevertheless, the underlying mechanism of blinking suppression remains unclear and debated. Here, by deterministically coupling a single QD to a plasmonic nanocavity, we clarify the mechanism of blinking suppression, and demonstrate unprecedentedly bright emission from a single colloidal QD. In particular, we report for the first time that the coupled system exhibits nonblinking photoluminescence with blinking lifetime, which shows that the elimination of photoluminescence blinking originates from enhanced quantum yield of the charged states. We identify that the radiative decay rate is boosted from (48 ns)-1 to (0.7 ns)-1, which outcompetes Auger processes and enables similar quantum yields for charged and neutral excitons. Moreover, we demonstrate ultrabright photoluminescence of up to 17 million detected photons per second from a single QD. This work sheds new light on the goal of achieving ultrabright nonblinking QDs and may benefit a variety of QD-based applications.

physics.optics↗

arXiv2021

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↗