Searcharxiv⌕ Search

arXiv subjects

Xinyi Xu

Publications and source records attributed to Xinyi Xu.

At least 37 records · Page 2Linked to original sources

Quasi-phase-matched up- and down-conversion in periodically poled layered semiconductors

Nonlinear optics lies at the heart of classical and quantum light generation. The invention of periodic poling revolutionized nonlinear optics and its commercial applications by enabling robust quasi-phase-matching in crystals such as lithium niobate. However, reaching useful frequency conversion efficiencies requires macroscopic dimensions, limiting further technology development and integration. Here we realize a periodically poled van der Waals semiconductor (3R-MoS$_2$). Due to its exceptional nonlinearity, we achieve macroscopic frequency conversion efficiency of 0.03% at the relevant telecom wavelength over a microscopic thickness of 3.4$μ$m (that is, 3 poling periods), $10-100\times$ thinner than current systems with similar performances. Due to unique intrinsic cavity effects, the thickness-dependent quasi-phase-matched second harmonic signal surpasses the usual quadratic enhancement by $50\%$. Further, we report the broadband generation of photon pairs at telecom wavelengths via quasi-phase-matched spontaneous parametric down-conversion, showing a maximum coincidence-to-accidental-ratio of $638 \pm 75$. This work opens the new and unexplored field of phase-matched nonlinear optics with microscopic van der Waals crystals, unlocking applications that require simple, ultra-compact technologies such as on-chip entangled photon-pair sources for integrated quantum circuitry and sensing.

physics.optics↗

Multi-Colouring of Kneser Graphs: Notes on Stahl's Conjecture

A (finite, undirected) graph is $(n,k)$-colourable if we can assign each vertex a $k$-subset of $\{1,2,\ldots,n\}$ so that adjacent vertices receive disjoint subsets. We consider the following problem: if a graph is $(n,k)$-colourable, then for what pairs $(n',k')$ is it also $(n',k')$-colourable? This question can be translated into a question regarding multi-colourings of Kneser graphs, for which Stahl formulated a conjecture in 1976. We present new results, strengthen existing results, and in particular present much simpler proofs of several known cases of the conjecture.

math.CO↗

Data value estimation on private gradients

For gradient-based machine learning (ML) methods commonly adopted in practice such as stochastic gradient descent, the de facto differential privacy (DP) technique is perturbing the gradients with random Gaussian noise. Data valuation attributes the ML performance to the training data and is widely used in privacy-aware applications that require enforcing DP such as data pricing, collaborative ML, and federated learning (FL). Can existing data valuation methods still be used when DP is enforced via gradient perturbations? We show that the answer is no with the default approach of injecting i.i.d.~random noise to the gradients because the estimation uncertainty of the data value estimation paradoxically linearly scales with more estimation budget, producing estimates almost like random guesses. To address this issue, we propose to instead inject carefully correlated noise to provably remove the linear scaling of estimation uncertainty w.r.t.~the budget. We also empirically demonstrate that our method gives better data value estimates on various ML tasks and is applicable to use cases including dataset valuation and~FL.

cs.LG↗

DETAIL: Task DEmonsTration Attribution for Interpretable In-context Learning

In-context learning (ICL) allows transformer-based language models that are pre-trained on general text to quickly learn a specific task with a few "task demonstrations" without updating their parameters, significantly boosting their flexibility and generality. ICL possesses many distinct characteristics from conventional machine learning, thereby requiring new approaches to interpret this learning paradigm. Taking the viewpoint of recent works showing that transformers learn in context by formulating an internal optimizer, we propose an influence function-based attribution technique, DETAIL, that addresses the specific characteristics of ICL. We empirically verify the effectiveness of our approach for demonstration attribution while being computationally efficient. Leveraging the results, we then show how DETAIL can help improve model performance in real-world scenarios through demonstration reordering and curation. Finally, we experimentally prove the wide applicability of DETAIL by showing our attribution scores obtained on white-box models are transferable to black-box models in improving model performance.

cs.CL↗

Spatiotemporal imaging of nonlinear optics in van der Waals waveguides

Van der Waals (vdW) semiconductors have emerged as promising platforms for efficient nonlinear optical conversion, including harmonic and entangled photon generation. Although major efforts are devoted to integrating vdW materials in nanoscale waveguides for miniaturization, the realization of efficient, phase-matched conversion in these platforms remains challenging. To address this challenge, we develop a far-field ultrafast imaging method to track the propagation of both fundamental and harmonic waves within vdW waveguides with extreme spatiotemporal resolution. Our approach allows systematic optimization of nonlinear conversion by determining the phase-matching angles, mode profiles, and losses in waveguides without a priori knowledge of material properties. We focus on light propagation in slab waveguides of rhombohedral-stacked MoS2, an emerging vdW semiconductor with giant nonlinear susceptibility. Our results reveal that these waveguides support birefringent phase-matching, demonstrating the material's potential for efficient on-chip nonlinear optics. This work establishes spatiotemporal imaging of light propagation in waveguides as an incisive and general method to identify new materials and architectures for efficient nonlinear nanophotonics.

cond-mat.mtrl-sci↗

Data Distribution Valuation

Data valuation is a class of techniques for quantitatively assessing the value of data for applications like pricing in data marketplaces. Existing data valuation methods define a value for a discrete dataset. However, in many use cases, users are interested in not only the value of the dataset, but that of the distribution from which the dataset was sampled. For example, consider a buyer trying to evaluate whether to purchase data from different vendors. The buyer may observe (and compare) only a small preview sample from each vendor, to decide which vendor's data distribution is most useful to the buyer and purchase. The core question is how should we compare the values of data distributions from their samples? Under a Huber characterization of the data heterogeneity across vendors, we propose a maximum mean discrepancy (MMD)-based valuation method which enables theoretically principled and actionable policies for comparing data distributions from samples. We empirically demonstrate that our method is sample-efficient and effective in identifying valuable data distributions against several existing baselines, on multiple real-world datasets (e.g., network intrusion detection, credit card fraud detection) and downstream applications (classification, regression).

cs.LG↗

Data-Centric AI in the Age of Large Language Models

This position paper proposes a data-centric viewpoint of AI research, focusing on large language models (LLMs). We start by making the key observation that data is instrumental in the developmental (e.g., pretraining and fine-tuning) and inferential stages (e.g., in-context learning) of LLMs, and yet it receives disproportionally low attention from the research community. We identify four specific scenarios centered around data, covering data-centric benchmarks and data curation, data attribution, knowledge transfer, and inference contextualization. In each scenario, we underscore the importance of data, highlight promising research directions, and articulate the potential impacts on the research community and, where applicable, the society as a whole. For instance, we advocate for a suite of data-centric benchmarks tailored to the scale and complexity of data for LLMs. These benchmarks can be used to develop new data curation methods and document research efforts and results, which can help promote openness and transparency in AI and LLM research.

cs.LG↗

Incentives in Private Collaborative Machine Learning

Collaborative machine learning involves training models on data from multiple parties but must incentivize their participation. Existing data valuation methods fairly value and reward each party based on shared data or model parameters but neglect the privacy risks involved. To address this, we introduce differential privacy (DP) as an incentive. Each party can select its required DP guarantee and perturb its sufficient statistic (SS) accordingly. The mediator values the perturbed SS by the Bayesian surprise it elicits about the model parameters. As our valuation function enforces a privacy-valuation trade-off, parties are deterred from selecting excessive DP guarantees that reduce the utility of the grand coalition's model. Finally, the mediator rewards each party with different posterior samples of the model parameters. Such rewards still satisfy existing incentives like fairness but additionally preserve DP and a high similarity to the grand coalition's posterior. We empirically demonstrate the effectiveness and practicality of our approach on synthetic and real-world datasets.

cs.LG↗

Voltage Control of Electromagnetic Properties in Antiferromagnetic Materials

Dynamic modulation of electromagnetic responses is theoretically examined in dielectric antiferromagnets. While both magneto-electric and magneto-elastic coupling can achieve robust electrical control of magnetic anisotropy, the latter is considered in a bilayer structure with a piezoelectric material. Numerical calculations based on the frequency-dependent permeability tensor clearly illustrate that the anisotropy profile in the typical uniaxial or biaxial antiferromagnets such as NiO and Cr2O3 can be modified sufficiently to induce a shift in the resonance frequency by as much as tens of percent in the sub-mm wavelength range (thus, an electrically tunable bandwidth over 10's of GHz). The polarization of the electromagnetic response is also affected due to the anisotropic nature of the effect, offering a possibility to encode the signal. The intrinsic delay in switching may be minimized to the ns level by using a sufficiently thin antiferromagnets. Application to specific devices such as a band-pass filter further illustrates the validity of the concept.

cond-mat.mtrl-sci↗

Visualizing moiré ferroelectricity via plasmons and nano-photocurrent in graphene/twisted-WSe2 structures

Ferroelectricity, a spontaneous and reversible electric polarization, is found in certain classes of van der Waals (vdW) material heterostructures. The discovery of ferroelectricity in twisted vdW layers provides new opportunities to engineer spatially dependent electric and optical properties associated with the configuration of moiré superlattice domains and the network of domain walls. Here, we employ near-field infrared nano-imaging and nano-photocurrent measurements to study ferroelectricity in minimally twisted WSe2. The ferroelectric domains are visualized through the imaging of the plasmonic response in a graphene monolayer adjacent to the moiré WSe2 bilayers. Specifically, we find that the ferroelectric polarization in moiré domains is imprinted on the plasmonic response of the graphene. Complementary nano-photocurrent measurements demonstrate that the optoelectronic properties of graphene are also modulated by the proximal ferroelectric domains. Our approach represents an alternative strategy for studying moiré ferroelectricity at native length scales and opens promising prospects for (opto)electronic devices.

cond-mat.mes-hall↗

Fair yet Asymptotically Equal Collaborative Learning

In collaborative learning with streaming data, nodes (e.g., organizations) jointly and continuously learn a machine learning (ML) model by sharing the latest model updates computed from their latest streaming data. For the more resourceful nodes to be willing to share their model updates, they need to be fairly incentivized. This paper explores an incentive design that guarantees fairness so that nodes receive rewards commensurate to their contributions. Our approach leverages an explore-then-exploit formulation to estimate the nodes' contributions (i.e., exploration) for realizing our theoretically guaranteed fair incentives (i.e., exploitation). However, we observe a "rich get richer" phenomenon arising from the existing approaches to guarantee fairness and it discourages the participation of the less resourceful nodes. To remedy this, we additionally preserve asymptotic equality, i.e., less resourceful nodes achieve equal performance eventually to the more resourceful/"rich" nodes. We empirically demonstrate in two settings with real-world streaming data: federated online incremental learning and federated reinforcement learning, that our proposed approach outperforms existing baselines in fairness and learning performance while remaining competitive in preserving equality.

cs.LG↗

3D Molecular Geometry Analysis with 2D Graphs

Ground-state 3D geometries of molecules are essential for many molecular analysis tasks. Modern quantum mechanical methods can compute accurate 3D geometries but are computationally prohibitive. Currently, an efficient alternative to computing ground-state 3D molecular geometries from 2D graphs is lacking. Here, we propose a novel deep learning framework to predict 3D geometries from molecular graphs. To this end, we develop an equilibrium message passing neural network (EMPNN) to better capture ground-state geometries from molecular graphs. To provide a testbed for 3D molecular geometry analysis, we develop a benchmark that includes a large-scale molecular geometry dataset, data splits, and evaluation protocols. Experimental results show that EMPNN can efficiently predict more accurate ground-state 3D geometries than RDKit and other deep learning methods. Results also show that the proposed framework outperforms self-supervised learning methods on property prediction tasks.

physics.chem-ph↗

Probably Approximate Shapley Fairness with Applications in Machine Learning

The Shapley value (SV) is adopted in various scenarios in machine learning (ML), including data valuation, agent valuation, and feature attribution, as it satisfies their fairness requirements. However, as exact SVs are infeasible to compute in practice, SV estimates are approximated instead. This approximation step raises an important question: do the SV estimates preserve the fairness guarantees of exact SVs? We observe that the fairness guarantees of exact SVs are too restrictive for SV estimates. Thus, we generalise Shapley fairness to probably approximate Shapley fairness and propose fidelity score, a metric to measure the variation of SV estimates, that determines how probable the fairness guarantees hold. Our last theoretical contribution is a novel greedy active estimation (GAE) algorithm that will maximise the lowest fidelity score and achieve a better fairness guarantee than the de facto Monte-Carlo estimation. We empirically verify GAE outperforms several existing methods in guaranteeing fairness while remaining competitive in estimation accuracy in various ML scenarios using real-world datasets.

cs.LG↗

On the Convergence of the Shapley Value in Parametric Bayesian Learning Games

Measuring contributions is a classical problem in cooperative game theory where the Shapley value is the most well-known solution concept. In this paper, we establish the convergence property of the Shapley value in parametric Bayesian learning games where players perform a Bayesian inference using their combined data, and the posterior-prior KL divergence is used as the characteristic function. We show that for any two players, under some regularity conditions, their difference in Shapley value converges in probability to the difference in Shapley value of a limiting game whose characteristic function is proportional to the log-determinant of the joint Fisher information. As an application, we present an online collaborative learning framework that is asymptotically Shapley-fair. Our result enables this to be achieved without any costly computations of posterior-prior KL divergences. Only a consistent estimator of the Fisher information is needed. The effectiveness of our framework is demonstrated with experiments using real-world data.

cs.LG↗

Infrared Plasmons Propagate through a Hyperbolic Nodal Metal

Metals are canonical plasmonic media at infrared and optical wavelengths, allowing one to guide and manipulate light at the nano-scale. A special form of optical waveguiding is afforded by highly anisotropic crystals revealing the opposite signs of the dielectric functions along orthogonal directions. These media are classified as hyperbolic and include crystalline insulators, semiconductors and artificial metamaterials. Layered anisotropic metals are also anticipated to support hyperbolic waveguiding. Yet this behavior remains elusive, primarily because interband losses arrest the propagation of infrared modes. Here, we report on the observation of propagating hyperbolic waves in a prototypical layered nodal-line semimetal ZrSiSe. The observed waveguiding originates from polaritonic hybridization between near-infrared light and nodal-line plasmons. Unique nodal electronic structures simultaneously suppress interband loss and boost the plasmonic response, ultimately enabling the propagation of infrared modes through the bulk of the crystal.

cond-mat.mes-hall↗

AFFIRM: Affinity Fusion-based Framework for Iteratively Random Motion correction of multi-slice fetal brain MRI

Multi-slice magnetic resonance images of the fetal brain are usually contaminated by severe and arbitrary fetal and maternal motion. Hence, stable and robust motion correction is necessary to reconstruct high-resolution 3D fetal brain volume for clinical diagnosis and quantitative analysis. However, the conventional registration-based correction has a limited capture range and is insufficient for detecting relatively large motions. Here, we present a novel Affinity Fusion-based Framework for Iteratively Random Motion (AFFIRM) correction of the multi-slice fetal brain MRI. It learns the sequential motion from multiple stacks of slices and integrates the features between 2D slices and reconstructed 3D volume using affinity fusion, which resembles the iterations between slice-to-volume registration and volumetric reconstruction in the regular pipeline. The method accurately estimates the motion regardless of brain orientations and outperforms other state-of-the-art learning-based methods on the simulated motion-corrupted data, with a 48.4% reduction of mean absolute error for rotation and 61.3% for displacement. We then incorporated AFFIRM into the multi-resolution slice-to-volume registration and tested it on the real-world fetal MRI scans at different gestation stages. The results indicated that adding AFFIRM to the conventional pipeline improved the success rate of fetal brain super-resolution reconstruction from 77.2% to 91.9%.

eess.IV↗

Towards compact phase-matched and waveguided nonlinear optics in atomically layered semiconductors

Nonlinear frequency conversion provides essential tools for light generation, photon entanglement, and manipulation. Transition metal dichalcogenides (TMDs) possess huge nonlinear susceptibilities and 3R-stacked TMD crystals further combine broken inversion symmetry and aligned layering, representing ideal candidates to boost the nonlinear optical gain with minimal footprint. Here, we report on the efficient frequency conversion of 3R-MoS2, revealing the evolution of its exceptional second-order nonlinear processes along the ordinary (in-plane) and extraordinary (out-of-plane) directions. By measuring second harmonic generation (SHG) of 3R-MoS2 with various thickness - from monolayer (~0.65 nm) to bulk (~1 μm) - we present the first measurement of the in-plane SHG coherence length (~530 nm) at 1520 nm and achieve record nonlinear optical enhancement from a van der Waals material, >10^4 stronger than a monolayer. It is found that 3R-MoS2 slabs exhibit similar conversion efficiencies of lithium niobate, but within propagation lengths >100-fold shorter at telecom wavelengths. Furthermore, along the extraordinary axis, we achieve broadly tunable SHG from 3R-MoS2 in a waveguide geometry, revealing the coherence length in such structure for the first time. We characterize the full refractive index spectrum and quantify both birefringence components in anisotropic 3R-MoS2 crystals with near-field nano-imaging. Empowered with these data we assess the intrinsic limits of the conversion efficiency and nonlinear optical processes in 3R-MoS2 attainable in waveguide geometries. Our analysis highlights the potential of 3R-stacked TMDs for integrated photonics, providing critical parameters for designing highly efficient on-chip nonlinear optical devices including periodically poled structures, resonators, compact optical parametric oscillators and amplifiers, and optical quantum circuits.

physics.optics↗

Fetal Brain Tissue Annotation and Segmentation Challenge Results

In-utero fetal MRI is emerging as an important tool in the diagnosis and analysis of the developing human brain. Automatic segmentation of the developing fetal brain is a vital step in the quantitative analysis of prenatal neurodevelopment both in the research and clinical context. However, manual segmentation of cerebral structures is time-consuming and prone to error and inter-observer variability. Therefore, we organized the Fetal Tissue Annotation (FeTA) Challenge in 2021 in order to encourage the development of automatic segmentation algorithms on an international level. The challenge utilized FeTA Dataset, an open dataset of fetal brain MRI reconstructions segmented into seven different tissues (external cerebrospinal fluid, grey matter, white matter, ventricles, cerebellum, brainstem, deep grey matter). 20 international teams participated in this challenge, submitting a total of 21 algorithms for evaluation. In this paper, we provide a detailed analysis of the results from both a technical and clinical perspective. All participants relied on deep learning methods, mainly U-Nets, with some variability present in the network architecture, optimization, and image pre- and post-processing. The majority of teams used existing medical imaging deep learning frameworks. The main differences between the submissions were the fine tuning done during training, and the specific pre- and post-processing steps performed. The challenge results showed that almost all submissions performed similarly. Four of the top five teams used ensemble learning methods. However, one team's algorithm performed significantly superior to the other submissions, and consisted of an asymmetrical U-Net network architecture. This paper provides a first of its kind benchmark for future automatic multi-tissue segmentation algorithms for the developing human brain in utero.

eess.IV↗