arXiv subjects

Yifei Ma

Publications and source records attributed to Yifei Ma.

At least 37 records · Page 2Linked to original sources

arXiv2025

Complex structured light generation using printed liquid crystal droplets

Inkjet-printed liquid crystal (LC) droplets exhibit an intricate spatially-varying birefringence due to their complex internal director configuration. While such anisotropy is often viewed as a drawback when LC droplets are used as microlenses, here we leverage this remarkable birefringence property to generate complex structured light. Through a selection of the alignment layer, and by varying the chiral pitch, we create three distinct droplet types with tailored intrinsic director configurations, each exhibiting a unique birefringence distribution for structured light beam generation. We show that these printed LC droplets can generate beams that exhibit skyrmionic structures carrying two units of orbital angular momentum, beams that contain azimuthal/radial polarized fields, and beams with polarization singularities. Our method enables new possibilities for using LC droplet technology to engineer sophisticated optical beam patterns.

physics.optics↗

arXiv2025

Ultrafast and reliable domain-wall and skyrmion logic in a chirally coupled ferrimagnet

Unlocking the spin degree of freedom in addition to the electron's charge, spin-based logic offers an in-memory computing architecture beyond-CMOS technology. Here, we encode information into chiral spin textures (e.g., chiral domain-wall and skyrmion) and achieve an ultrafast and reliable all-electrical logic by exploiting the Dzyaloshinskii-Moriya interaction-induced chiral coupling. Taking advantage of fast spin dynamics in antiferromagnetically coupled systems, we achieved a fast domain-wall motion passing through the logic gate, exceeding 1 kilometre per second, yielding an operation time of 50 picoseconds for a 50 nanometres-long logic gate. Furthermore, we present a fast logic operation with skyrmion bubbles in a racetrack that exhibits a topologically protected computation scheme. Our work demonstrates a viable approach for advanced microchips with high operation frequency and ultralow power consumption, paving the way for next-generation computing technologies.

cond-mat.mes-hall↗

arXiv2025

Physically Plausible Vectorial Metrics for Polarization Information Analysis

The Mueller Matrix Polar Decomposition method decomposes a Mueller matrix into a diattenuator, a retarder, and a depolarizer. Among these elements, the retarder, which plays a key role in medical and material characterization, is modelled as a circular retarder followed by a linear retarder when using this approach. However, this model may not accurately reflect the actual structure of the retarder in certain cases, as many practical retarders do not have a layered structure or consist of multiple (unknown) layers. Misinterpretation, therefore, may occur when the actual structure differs from the model. Here we circumvent this limitation by proposing to use a physically plausible parameter set that includes the axis orientation angle $ϕ$, the degree of ellipticity $χ$, and the elliptical retardance $ρ$. By working with this set of parameters, an overall characterization of a retarder is provided, encompassing its full optical response without making any assumptions about the structure of the material. In this study, experiments were carried out on liquid crystalline samples to validate the feasibility of our approach, demonstrating that the physically plausible parameter set adopted provides a useful tool for a broader range of applications in both biomedical imaging and optical material analysis.

physics.optics↗

arXiv2025

Optical Skyrmions in Waveguides

Optical skyrmions are topologically non-trivial polarization fields which have recently attracted attention due to their potential use in high density data applications such as optical communications, photonic computing and more. An important hurdle in utilizing optical skyrmions for such applications is establishing conditions under which their topological structure remains preserved during propagation: while results of this type already exist for paraxial beams in free-space propagation, the critical case relevant to modern applications involves propagation in confined media, such as waveguide systems. In this paper, we demonstrate for the first time that, within a conducting waveguide, the preservation of the skyrmion number during propagation is determined by the presence of so-called topologically stabilizing modes. If such a mode is present, not only will topological protection hold despite the transverse polarization profile changing due to modal dispersion, but there is also a degree of robustness to variations in the coefficients of TE and TM modes present. Lastly, we demonstrate how a generalized skyrmion number can recover topological protection in situations where the usual skyrmion number is not preserved. Our methods open new avenues for robust high-dimensional information manipulation in waveguiding systems.

physics.optics↗

arXiv2025

Intensity adaptive optics

Adaptive optics (AO) is a powerful tool employed across various research fields, from aerospace to microscopy. Traditionally, AO has focused on correcting optical phase aberrations, with recent advances extending to polarisation compensation. However, intensity errors are also prevalent in optical systems, yet effective correction methods are still in their infancy. Here, we introduce a novel AO approach, termed intensity adaptive optics (I-AO), which employs a dual-feedback loop mechanism to first address non-uniform intensity distribution and subsequently compensate for energy loss at the pupil plane. We demonstrate that I-AO can operate in both sensor-based and sensorless formats and validate its feasibility by quantitatively analysing the focus quality of an aberrated system. This technique expands the AO toolkit, paving the way for next-generation AO technology.

physics.optics↗

arXiv2024

Unlocking adaptive digital pathology through dynamic feature learning

Foundation models have revolutionized the paradigm of digital pathology, as they leverage general-purpose features to emulate real-world pathological practices, enabling the quantitative analysis of critical histological patterns and the dissection of cancer-specific signals. However, these static general features constrain the flexibility and pathological relevance in the ever-evolving needs of clinical applications, hindering the broad use of the current models. Here we introduce PathFiT, a dynamic feature learning method that can be effortlessly plugged into various pathology foundation models to unlock their adaptability. Meanwhile, PathFiT performs seamless implementation across diverse pathology applications regardless of downstream specificity. To validate PathFiT, we construct a digital pathology benchmark with over 20 terabytes of Internet and real-world data comprising 28 H\&E-stained tasks and 7 specialized imaging tasks including Masson's Trichrome staining and immunofluorescence images. By applying PathFiT to the representative pathology foundation models, we demonstrate state-of-the-art performance on 34 out of 35 tasks, with significant improvements on 23 tasks and outperforming by 10.20% on specialized imaging tasks. The superior performance and versatility of PathFiT open up new avenues in computational pathology.

eess.IV↗

arXiv2024

Generalized Skyrmions

Skyrmions are important topologically non-trivial fields characteristic of models spanning scales from the microscopic to the cosmological. However, the Skyrmion number can only be defined for fields with specific boundary conditions, limiting its use in broader contexts. Here, we address this issue through a generalized notion of the Skyrmion derived from the De Rham cohomology of compactly supported forms. This allows for the definition of an entirely new $\coprod_{i=1}^\infty \mathbb{Z}^i$-valued topological number that assigns a tuple of integers $(a_1, \ldots, a_k)\in \mathbb{Z}^k$ to a field instead of a single number, with no restrictions to its boundary. The notion of the generalized Skyrmion presented in this paper is completely abstract and can be applied to vector fields in any discipline, not unlike index theory within dynamical systems. To demonstrate the power of our new formalism, we focus on the propagation of optical polarization fields and show that our newly defined generalized Skyrmion number significantly increases the dimension of data that can be stored within the field while also demonstrating strong robustness. Our work represents a fundamental paradigm shift away from the study of fields with natural topological character to engineered fields that can be artificially embedded with topological structures.

physics.optics↗

arXiv2024

Topological Protection of Optical Skyrmions through Complex Media

Optical Skyrmions have many important properties that make them ideal units for high-density data applications, including the ability to carry digital information through a discrete topological number and the independence of spatially varying polarization to other dimensions. More importantly, the topological nature of the optical Skyrmion heuristically suggests a strong degree of robustness to perturbations, which is crucial for reliably carrying information in noisy environments. However, the study of the topological robustness of optical Skyrmions is still in its infancy. Here, we quantify this robustness precisely by proving that the topological nature of the Skyrmion arises from its structure on the boundary and, by duality, is therefore resilient to complex perturbations provided they respect the relevant boundary conditions of the unperturbed Skyrmion. We then present experimental evidence validating this robustness in the context of paraxial Skyrmion beams against different polarization aberrations. Our work provides a framework for handling various perturbations of Skyrmion fields and offers guarantees of robustness in a general sense. This, in turn, has implications for applications of the optical Skyrmion where their topological nature is exploited explicitly, and, in particular, provides an underpinning for the use of Skyrmions in optical communications and photonic computing.

physics.optics↗

arXiv2024

Aligning Vision Models with Human Aesthetics in Retrieval: Benchmarks and Algorithms

Modern vision models are trained on very large noisy datasets. While these models acquire strong capabilities, they may not follow the user's intent to output the desired results in certain aspects, e.g., visual aesthetic, preferred style, and responsibility. In this paper, we target the realm of visual aesthetics and aim to align vision models with human aesthetic standards in a retrieval system. Advanced retrieval systems usually adopt a cascade of aesthetic models as re-rankers or filters, which are limited to low-level features like saturation and perform poorly when stylistic, cultural or knowledge contexts are involved. We find that utilizing the reasoning ability of large language models (LLMs) to rephrase the search query and extend the aesthetic expectations can make up for this shortcoming. Based on the above findings, we propose a preference-based reinforcement learning method that fine-tunes the vision models to distill the knowledge from both LLMs reasoning and the aesthetic models to better align the vision models with human aesthetics. Meanwhile, with rare benchmarks designed for evaluating retrieval systems, we leverage large multi-modality model (LMM) to evaluate the aesthetic performance with their strong abilities. As aesthetic assessment is one of the most subjective tasks, to validate the robustness of LMM, we further propose a novel dataset named HPIR to benchmark the alignment with human aesthetics. Experiments demonstrate that our method significantly enhances the aesthetic behaviors of the vision models, under several metrics. We believe the proposed algorithm can be a general practice for aligning vision models with human values.

cs.CV↗

arXiv2024

Experimental Design for Active Transductive Inference in Large Language Models

One emergent ability of large language models (LLMs) is that query-specific examples can be included in the prompt at inference time. In this work, we use active learning for adaptive prompt design and call it Active In-context Prompt Design (AIPD). We design the LLM prompt by adaptively choosing few-shot examples from a training set to optimize performance on a test set. The training examples are initially unlabeled and we obtain the label of the most informative ones, which maximally reduces uncertainty in the LLM prediction. We propose two algorithms, GO and SAL, which differ in how the few-shot examples are chosen. We analyze these algorithms in linear models: first GO and then use its equivalence with SAL. We experiment with many different tasks in small, medium-sized, and large language models; and show that GO and SAL outperform other methods for choosing few-shot examples in the LLM prompt at inference time.

cs.LG↗

arXiv2024

Logic-Scaffolding: Personalized Aspect-Instructed Recommendation Explanation Generation using LLMs

The unique capabilities of Large Language Models (LLMs), such as the natural language text generation ability, position them as strong candidates for providing explanation for recommendations. However, despite the size of the LLM, most existing models struggle to produce zero-shot explanations reliably. To address this issue, we propose a framework called Logic-Scaffolding, that combines the ideas of aspect-based explanation and chain-of-thought prompting to generate explanations through intermediate reasoning steps. In this paper, we share our experience in building the framework and present an interactive demonstration for exploring our results.

cs.AI↗

arXiv2023

Vectorial adaptive optics for advanced imaging systems

Vectorial adaptive optics (V-AO) is a cutting-edge technique extending conventional AO into the vectorial domain encompassing both polarization and phase feedback correction for optical systems. However, previous V-AO approaches focus on point correction. In this letter, we extend this AO approach into the imaging domain. We show how V-AO can benefit an aberrated imaging system to enhance not only scalar imaging but also the quality of vectorial information. Two important criteria, vectorial precision and uniformity are put forward and used in practice to evaluate the performance of the correction. These experimental validations pave the way for real-world imaging for V-AO technology and its applications.

physics.optics↗

arXiv2023

Efficient current-induced spin torques and field-free magnetization switching in a room-temperature van der Waals magnet

The discovery of magnetism in van der Waals (vdW) materials has established unique building blocks for the research of emergent spintronic phenomena. In particular, owing to their intrinsically clean surface without dangling bonds, the vdW magnets hold the potential to construct a superior interface that allows for efficient electrical manipulation of magnetism. Despite several attempts in this direction, it usually requires a cryogenic condition and the assistance of external magnetic fields, which is detrimental to the real application. Here, we fabricate heterostructures based on Fe3GaTe2 flakes that possess room-temperature ferromagnetism with excellent perpendicular magnetic anisotropy. The current-driven non-reciprocal modulation of coercive fields reveals a high spin-torque efficiency in the Fe3GaTe2/Pt heterostructures, which further leads to a full magnetization switching by current. Moreover, we demonstrate the field-free magnetization switching resulting from out-of-plane polarized spin currents by asymmetric geometry design. Our work could expedite the development of efficient vdW spintronic logic, memory and neuromorphic computing devices.

cond-mat.mtrl-sci↗

arXiv2023

Fixed-Budget Best-Arm Identification with Heterogeneous Reward Variances

We study the problem of best-arm identification (BAI) in the fixed-budget setting with heterogeneous reward variances. We propose two variance-adaptive BAI algorithms for this setting: SHVar for known reward variances and SHAdaVar for unknown reward variances. Our algorithms rely on non-uniform budget allocations among the arms where the arms with higher reward variances are pulled more often than those with lower variances. The main algorithmic novelty is in the design of SHAdaVar, which allocates budget greedily based on overestimating the unknown reward variances. We bound probabilities of misidentifying the best arms in both SHVar and SHAdaVar. Our analyses rely on novel lower bounds on the number of pulls of an arm that do not require closed-form solutions to the budget allocation problem. Since one of our budget allocation problems is analogous to the optimal experiment design with unknown variances, we believe that our results are of a broad interest. Our experiments validate our theory, and show that SHVar and SHAdaVar outperform algorithms from prior works with analytical guarantees.

cs.LG↗

arXiv2023

Topologically controlled multiskyrmions in photonic gradient-index lenses

Skyrmions are topologically protected quasiparticles, originally studied in condensed-matter systems and recently in photonics, with great potential in ultra-high-capacity information storage. Despite the recent attention, most optical solutions require complex and expensive systems yet produce limited topologies. Here we demonstrate an extended family of quasiparticles beyond normal skyrmions, which are controlled in confined photonic gradient-index media, extending to higher-order members such as multiskyrmions and multimerons, with increasingly complex topologies. We introduce new topological numbers to describe these complex photonic quasiparticles and propose how this new zoology of particles could be used in future high-capacity information transfer. Our compact creation system lends integrated and programmable solutions of complex particle textures, with potential impacts on both photonic and condensed-matter systems for revolutionizing topological informatics and logic devices.

physics.optics↗

arXiv2022

Context Uncertainty in Contextual Bandits with Applications to Recommender Systems

Recurrent neural networks have proven effective in modeling sequential user feedbacks for recommender systems. However, they usually focus solely on item relevance and fail to effectively explore diverse items for users, therefore harming the system performance in the long run. To address this problem, we propose a new type of recurrent neural networks, dubbed recurrent exploration networks (REN), to jointly perform representation learning and effective exploration in the latent space. REN tries to balance relevance and exploration while taking into account the uncertainty in the representations. Our theoretical analysis shows that REN can preserve the rate-optimal sublinear regret even when there exists uncertainty in the learned representations. Our empirical study demonstrates that REN can achieve satisfactory long-term rewards on both synthetic and real-world recommendation datasets, outperforming state-of-the-art models.

cs.LG↗

arXiv2021

Zero-Shot Recommender Systems

Performance of recommender systems (RS) relies heavily on the amount of training data available. This poses a chicken-and-egg problem for early-stage products, whose amount of data, in turn, relies on the performance of their RS. On the other hand, zero-shot learning promises some degree of generalization from an old dataset to an entirely new dataset. In this paper, we explore the possibility of zero-shot learning in RS. We develop an algorithm, dubbed ZEro-Shot Recommenders (ZESRec), that is trained on an old dataset and generalize to a new one where there are neither overlapping users nor overlapping items, a setting that contrasts typical cross-domain RS that has either overlapping users or items. Different from categorical item indices, i.e., item ID, in previous methods, ZESRec uses items' natural-language descriptions (or description embeddings) as their continuous indices, and therefore naturally generalize to any unseen items. In terms of users, ZESRec builds upon recent advances on sequential RS to represent users using their interactions with items, thereby generalizing to unseen users as well. We study three pairs of real-world RS datasets and demonstrate that ZESRec can successfully enable recommendations in such a zero-shot setting, opening up new opportunities for resolving the chicken-and-egg problem for data-scarce startups or early-stage products.

cs.LG↗

arXiv2020

Towards Optimal Off-Policy Evaluation for Reinforcement Learning with Marginalized Importance Sampling

Motivated by the many real-world applications of reinforcement learning (RL) that require safe-policy iterations, we consider the problem of off-policy evaluation (OPE) -- the problem of evaluating a new policy using the historical data obtained by different behavior policies -- under the model of nonstationary episodic Markov Decision Processes (MDP) with a long horizon and a large action space. Existing importance sampling (IS) methods often suffer from large variance that depends exponentially on the RL horizon $H$. To solve this problem, we consider a marginalized importance sampling (MIS) estimator that recursively estimates the state marginal distribution for the target policy at every step. MIS achieves a mean-squared error of $$ \frac{1}{n} \sum\nolimits_{t=1}^H\mathbb{E}_μ\left[\frac{d_t^π(s_t)^2}{d_t^μ(s_t)^2} \mathrm{Var}_μ\left[\frac{π_t(a_t|s_t)}{μ_t(a_t|s_t)}\big( V_{t+1}^π(s_{t+1}) + r_t\big) \middle| s_t\right]\right] + \tilde{O}(n^{-1.5}) $$ where $μ$ and $π$ are the logging and target policies, $d_t^μ(s_t)$ and $d_t^π(s_t)$ are the marginal distribution of the state at $t$th step, $H$ is the horizon, $n$ is the sample size and $V_{t+1}^π$ is the value function of the MDP under $π$. The result matches the Cramer-Rao lower bound in \citet{jiang2016doubly} up to a multiplicative factor of $H$. To the best of our knowledge, this is the first OPE estimation error bound with a polynomial dependence on $H$. Besides theory, we show empirical superiority of our method in time-varying, partially observable, and long-horizon RL environments.

cs.LG↗