arXiv subjects

Xi Chen

Publications and source records attributed to Xi Chen.

At least 631 records · Page 35Linked to original sources

arXiv2023

Sampling metrics for robust reconstructions in multislice ptychography: Theory and experiment

While multislice electron ptychography can provide thermal-vibration limited resolution and 3D information, it relies on the proper selection of many intertwined experimental and computational parameters. Here, we outline a theoretical basis for selecting experimental parameters to enable robust ptychographic reconstructions. We develop a series of physically informed metrics to describe the selection of experimental parameters in multislice ptychography. Image simulations are used to comprehensively evaluate the validity of these metrics over a broad range of experimental conditions. We develop two metrics, areal oversampling and Ronchigram magnification, which predict reconstruction success with high accuracy. Lastly, we validate these conclusions with experimental ptychographic data, and demonstrate close agreement between trends in simulated and experimental data. Using these metrics, we achieve experimental multislice reconstructions at a scan step of $1.0 \unit{Å/px}$, enabling large field-of-view ($>\!18\unit{nm}$), data-efficient reconstructions. These experimental design principles enable the routine and reliable use of multislice ptychography for materials characterization.

cond-mat.mtrl-sci↗

arXiv2023

Testing Intersecting and Union-Closed Families

Inspired by the classic problem of Boolean function monotonicity testing, we investigate the testability of other well-studied properties of combinatorial finite set systems, specifically \emph{intersecting} families and \emph{union-closed} families. A function $f: \{0,1\}^n \to \{0,1\}$ is intersecting (respectively, union-closed) if its set of satisfying assignments corresponds to an intersecting family (respectively, a union-closed family) of subsets of $[n]$. Our main results are that -- in sharp contrast with the property of being a monotone set system -- the property of being an intersecting set system, and the property of being a union-closed set system, both turn out to be information-theoretically difficult to test. We show that: $\bullet$ For $ε\geq Ω(1/\sqrt{n})$, any non-adaptive two-sided $ε$-tester for intersectingness must make $2^{Ω(n^{1/4}/\sqrtε)}$ queries. We also give a $2^{Ω(\sqrt{n \log(1/ε)})}$-query lower bound for non-adaptive one-sided $ε$-testers for intersectingness. $\bullet$ For $ε\geq 1/2^{Ω(n^{0.49})}$, any non-adaptive two-sided $ε$-tester for union-closedness must make $n^{Ω(\log(1/ε))}$ queries. Thus, neither intersectingness nor union-closedness shares the $\mathrm{poly}(n,1/ε)$-query non-adaptive testability that is enjoyed by monotonicity. To complement our lower bounds, we also give a simple $\mathrm{poly}(n^{\sqrt{n\log(1/ε)}},1/ε)$-query, one-sided, non-adaptive algorithm for $ε$-testing each of these properties (intersectingness and union-closedness). We thus achieve nearly tight upper and lower bounds for two-sided testing of intersectingness when $ε= Θ(1/\sqrt{n})$, and for one-sided testing of intersectingness when $ε=Θ(1).$

cs.CC↗

arXiv2023

Methodologies for 176Lu-176Hf Analysis of Zircon Grains from the Moon and Beyond

Zircons are found in extraterrestrial rocks from the Moon, Mars, and some differentiated meteorite parent-bodies. These zircons are rare, often of small size, and have been affected by neutron capture induced by cosmic ray exposure. The application of the 176Lu-176Hf decay system to zircons from planetary bodies such as the Moon can help establish the chronology of large-scale differentiation processes, like the crystallization of the lunar magma ocean. Here, we present methods to measure the isotopic composition of Hf of extraterrestrial zircons dated using ID-TIMS U-Pb after chemical abrasion. We introduce a 2-stage elution scheme to separate Hf from Zr while preserving the unused Zr fraction for future isotopic analysis. The effect of neutron capture is also re-examined using the latest thermal neutron capture cross sections and epithermal resonance integrals. Our tests show that the precision of Hf isotopic analyses is close to what is theoretically attainable. We have tested this method to a limited set of zircon grains from lunar rocks returned by the Apollo missions (lunar soil 14163, fragmental polymict breccia 72275, and clast-rich breccia 14321). The model ages align with previously reported values, but further work is needed to assess the chronology of lunar magma ocean crystallization as only a handful of small zircons (5 zircons from 3 samples) were analyzed, and the precision of the analyses can be improved by measuring more and larger lunar zircon grains.

astro-ph.EP↗

arXiv2023

Schema-adaptable Knowledge Graph Construction

Conventional Knowledge Graph Construction (KGC) approaches typically follow the static information extraction paradigm with a closed set of pre-defined schema. As a result, such approaches fall short when applied to dynamic scenarios or domains, whereas a new type of knowledge emerges. This necessitates a system that can handle evolving schema automatically to extract information for KGC. To address this need, we propose a new task called schema-adaptable KGC, which aims to continually extract entity, relation, and event based on a dynamically changing schema graph without re-training. We first split and convert existing datasets based on three principles to build a benchmark, i.e., horizontal schema expansion, vertical schema expansion, and hybrid schema expansion; then investigate the schema-adaptable performance of several well-known approaches such as Text2Event, TANL, UIE and GPT-3.5. We further propose a simple yet effective baseline dubbed \textsc{AdaKGC}, which contains schema-enriched prefix instructor and schema-conditioned dynamic decoding to better handle evolving schema. Comprehensive experimental results illustrate that AdaKGC can outperform baselines but still have room for improvement. We hope the proposed work can deliver benefits to the community. Code and datasets available at https://github.com/zjunlp/AdaKGC.

cs.CL↗

arXiv2023

Pruning random resistive memory for optimizing analogue AI

The rapid advancement of artificial intelligence (AI) has been marked by the large language models exhibiting human-like intelligence. However, these models also present unprecedented challenges to energy consumption and environmental sustainability. One promising solution is to revisit analogue computing, a technique that predates digital computing and exploits emerging analogue electronic devices, such as resistive memory, which features in-memory computing, high scalability, and nonvolatility. However, analogue computing still faces the same challenges as before: programming nonidealities and expensive programming due to the underlying devices physics. Here, we report a universal solution, software-hardware co-design using structural plasticity-inspired edge pruning to optimize the topology of a randomly weighted analogue resistive memory neural network. Software-wise, the topology of a randomly weighted neural network is optimized by pruning connections rather than precisely tuning resistive memory weights. Hardware-wise, we reveal the physical origin of the programming stochasticity using transmission electron microscopy, which is leveraged for large-scale and low-cost implementation of an overparameterized random neural network containing high-performance sub-networks. We implemented the co-design on a 40nm 256K resistive memory macro, observing 17.3% and 19.9% accuracy improvements in image and audio classification on FashionMNIST and Spoken digits datasets, as well as 9.8% (2%) improvement in PR (ROC) in image segmentation on DRIVE datasets, respectively. This is accompanied by 82.1%, 51.2%, and 99.8% improvement in energy efficiency thanks to analogue in-memory computing. By embracing the intrinsic stochasticity and in-memory computing, this work may solve the biggest obstacle of analogue computing systems and thus unleash their immense potential for next-generation AI hardware.

cs.ET↗

arXiv2023

Single-Layer Digitized-Counterdiabatic Quantum Optimization for $p$-spin Models

Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers from limited hardware coherence times. In this sense, counterdiabatic quantum protocols provide a shortcut to this process, steering the system along its ground state with fast-changing Hamiltonian. In this work, we take full advantage of a digitized-counterdiabatic quantum optimization (DCQO) algorithm to find an optimal solution of the $p$-spin model up to 4-local interactions. We choose a suitable scheduling function and initial Hamiltonian such that a single-layer quantum circuit suffices to produce a good ground-state overlap. By further optimizing parameters using variational methods, we solve with unit accuracy 2-spin, 3-spin, and 4-spin problems for $100\%$, $93\%$, and $83\%$ of instances, respectively. As a particular case of the latter, we also solve factorization problems involving 5, 9, and 12 qubits. Due to the low computational overhead, our compact approach may become a valuable tool towards quantum advantage in the NISQ era.

quant-ph↗

arXiv2023

The fundamental drivers of electrochemical barriers

We find that ion creation/destruction dominates the behavior of electrochemical reaction barriers, through grand-canonical electronic structure calculations of proton-deposition on transition metal surfaces. We show that barriers respond to potential in a nonlinear manner and trace this to the continuous degree of electron transfer as an ion is created or destroyed. This explains both Marcus-like curvature and Hammond-like shifts. Across materials, we find the barrier energy to be driven primarily by the charge presented on the surface, which in turn is dictated by the native work function, a fundamentally different driving force than non-electrochemical systems.

physics.chem-ph↗

arXiv2023

Evolutionary City: Towards a Flexible, Agile and Symbiotic System

Urban growth sometimes leads to rigid infrastructure that struggles to adapt to changing demand. This paper introduces a novel approach, aiming to enable cities to evolve and respond more effectively to such dynamic demand. It identifies the limitations arising from the complexity and inflexibility of existing urban systems. A framework is presented for enhancing the city's adaptability perception through advanced sensing technologies, conducting parallel simulation via graph-based techniques, and facilitating autonomous decision-making across domains through decentralized and autonomous organization and operation. Notably, a symbiotic mechanism is employed to implement these technologies practically, thereby making urban management more agile and responsive. In the case study, we explore how this approach can optimize traffic flow by adjusting lane allocations. This case not only enhances traffic efficiency but also reduces emissions. The proposed evolutionary city offers a new perspective on sustainable urban development, highliting the importance of integrated intelligence within urban systems.

cs.CY↗

arXiv2023

The Future of ChatGPT-enabled Labor Market: A Preliminary Study in China

As a phenomenal large language model, ChatGPT has achieved unparalleled success in various real-world tasks and increasingly plays an important role in our daily lives and work. However, extensive concerns are also raised about the potential ethical issues, especially about whether ChatGPT-like artificial general intelligence (AGI) will replace human jobs. To this end, in this paper, we introduce a preliminary data-driven study on the future of ChatGPT-enabled labor market from the view of Human-AI Symbiosis instead of Human-AI Confrontation. To be specific, we first conduct an in-depth analysis of large-scale job posting data in BOSS Zhipin, the largest online recruitment platform in China. The results indicate that about 28% of occupations in the current labor market require ChatGPT-related skills. Furthermore, based on a large-scale occupation-centered knowledge graph, we develop a semantic information enhanced collaborative filtering algorithm to predict the future occupation-skill relations in the labor market. As a result, we find that additional 45% occupations in the future will require ChatGPT-related skills. In particular, industries related to technology, products, and operations are expected to have higher proficiency requirements for ChatGPT-related skills, while the manufacturing, services, education, and health science related industries will have lower requirements for ChatGPT-related skills.

cs.CY↗

arXiv2023

Statistical Inference for Model Parameters in Stochastic Gradient Descent

The stochastic gradient descent (SGD) algorithm has been widely used in statistical estimation for large-scale data due to its computational and memory efficiency. While most existing works focus on the convergence of the objective function or the error of the obtained solution, we investigate the problem of statistical inference of true model parameters based on SGD when the population loss function is strongly convex and satisfies certain smoothness conditions. Our main contributions are two-fold. First, in the fixed dimension setup, we propose two consistent estimators of the asymptotic covariance of the average iterate from SGD: (1) a plug-in estimator, and (2) a batch-means estimator, which is computationally more efficient and only uses the iterates from SGD. Both proposed estimators allow us to construct asymptotically exact confidence intervals and hypothesis tests. Second, for high-dimensional linear regression, using a variant of the SGD algorithm, we construct a debiased estimator of each regression coefficient that is asymptotically normal. This gives a one-pass algorithm for computing both the sparse regression coefficients and confidence intervals, which is computationally attractive and applicable to online data.

stat.ML↗

arXiv2023

Algebraic Hyperbolicity of Complements of Generic Hypersurfaces in Projective Spaces

We study the algebraic hyperbolicity of the complement of very general degree $2n$ hypersurfaces in P^n. We prove the Algebraic Green-Griffiths-Lang Conjecture for these complements, and in the case of the complement of a quartic plane curve, we completely characterize the exceptional locus as the union of the flex and bitangent lines.

math.AG↗

arXiv2023

Triplet Attention Transformer for Spatiotemporal Predictive Learning

Spatiotemporal predictive learning offers a self-supervised learning paradigm that enables models to learn both spatial and temporal patterns by predicting future sequences based on historical sequences. Mainstream methods are dominated by recurrent units, yet they are limited by their lack of parallelization and often underperform in real-world scenarios. To improve prediction quality while maintaining computational efficiency, we propose an innovative triplet attention transformer designed to capture both inter-frame dynamics and intra-frame static features. Specifically, the model incorporates the Triplet Attention Module (TAM), which replaces traditional recurrent units by exploring self-attention mechanisms in temporal, spatial, and channel dimensions. In this configuration: (i) temporal tokens contain abstract representations of inter-frame, facilitating the capture of inherent temporal dependencies; (ii) spatial and channel attention combine to refine the intra-frame representation by performing fine-grained interactions across spatial and channel dimensions. Alternating temporal, spatial, and channel-level attention allows our approach to learn more complex short- and long-range spatiotemporal dependencies. Extensive experiments demonstrate performance surpassing existing recurrent-based and recurrent-free methods, achieving state-of-the-art under multi-scenario examination including moving object trajectory prediction, traffic flow prediction, driving scene prediction, and human motion capture.

cs.CV↗

arXiv2023

Shortcuts to Adiabatic Soliton Compression in Active Nonlinear Kerr Media

We implement variational shortcuts to adiabaticity for optical pulse compression in an active nonlinear Kerr medium with distributed amplification and spatially varying dispersion and nonlinearity. Starting with the hyperbolic secant ansatz, we employ a variational approximation to systematically derive dynamical equations, establishing analytical relationships linking the amplitude, width, and chirp of the pulse. Through the inverse engineering approach, we manipulate the distributed gain/loss, nonlinearity and dispersion profiles to efficiently compress the optical pulse over a reduced distance with high fidelity. In addition, we explore the dynamical stability of the system to illustrate the advantage of our protocol over conventional adiabatic approaches. Finally, we analyze the impact of tailored higher-order dispersion on soliton self-compression and derive physical constraints on the final soliton width for the complementary case of soliton expansion. The broader implications of our findings extend beyond optical systems, encompassing areas such as cold-atom and magnetic systems highlighting the versatility and relevance of our approach in various physical contexts.

physics.optics↗

arXiv2023

MaXM: Towards Multilingual Visual Question Answering

Visual Question Answering (VQA) has been primarily studied through the lens of the English language. Yet, tackling VQA in other languages in the same manner would require a considerable amount of resources. In this paper, we propose scalable solutions to multilingual visual question answering (mVQA), on both data and modeling fronts. We first propose a translation-based framework to mVQA data generation that requires much less human annotation efforts than the conventional approach of directly collection questions and answers. Then, we apply our framework to the multilingual captions in the Crossmodal-3600 dataset and develop an efficient annotation protocol to create MaXM, a test-only VQA benchmark in 7 diverse languages. Finally, we develop a simple, lightweight, and effective approach as well as benchmark state-of-the-art English and multilingual VQA models. We hope that our benchmark encourages further research on mVQA.

cs.CL↗

arXiv2023

SoK: MEV Countermeasures: Theory and Practice

Blockchains offer strong security guarantees, but they cannot protect the ordering of transactions. Powerful players, such as miners, sequencers, and sophisticated bots, can reap significant profits by selectively including, excluding, or re-ordering user transactions. Such profits are called Miner/Maximal Extractable Value or MEV. MEV bears profound implications for blockchain security and decentralization. While numerous countermeasures have been proposed, there is no agreement on the best solution. Moreover, solutions developed in academic literature differ quite drastically from what is widely adopted by practitioners. For these reasons, this paper systematizes the knowledge of the theory and practice of MEV countermeasures. The contribution is twofold. First, we present a comprehensive taxonomy of 30 proposed MEV countermeasures, covering four different technical directions. Secondly, we empirically studied the most popular MEV-auction-based solution with rich blockchain and mempool data. We also present the Mempool Guru system, a public service system that collects, persists, and analyzes the Ethereum mempool data for research. In addition to gaining insights into MEV auction platforms' real-world operations, our study shed light on the prevalent censorship by MEV auction platforms as a result of the recent OFAC sanction, and its implication on blockchain properties.

cs.CR↗

arXiv2023

PaLI-3 Vision Language Models: Smaller, Faster, Stronger

This paper presents PaLI-3, a smaller, faster, and stronger vision language model (VLM) that compares favorably to similar models that are 10x larger. As part of arriving at this strong performance, we compare Vision Transformer (ViT) models pretrained using classification objectives to contrastively (SigLIP) pretrained ones. We find that, while slightly underperforming on standard image classification benchmarks, SigLIP-based PaLI shows superior performance across various multimodal benchmarks, especially on localization and visually-situated text understanding. We scale the SigLIP image encoder up to 2 billion parameters, and achieves a new state-of-the-art on multilingual cross-modal retrieval. We hope that PaLI-3, at only 5B parameters, rekindles research on fundamental pieces of complex VLMs, and could fuel a new generation of scaled-up models.

cs.CV↗

arXiv2023

Real Regulators for Products of Elliptic Curves

Assuming the Kunneth decomposition of the Chow groups of products of general Kummer surfaces, we prove that the Hodge-${\mathcal D}$-conjecture fails for the real regulator $r_{k,1}$ on a product of $n$ general elliptic curves for $2n\ge 3k-1\ge 8$.

math.AG↗

arXiv2023

A High-Mass Young Star-forming Core Escaping from Its Parental Filament

We studied the unique kinematic properties in massive filament G352.63-1.07 at $10^3$-AU spatial scale with the dense molecular tracers observed with the Atacama Large Millimeter/submillimeter Array (ALMA). We find the central massive core M1 (12 $M_\odot$) being separated from the surrounding filament with a velocity difference of $v- {v}_{sys}=-2$ km/s and a transverse separation within 3 arcsec. Meanwhile, as shown in multiple dense-gas tracers, M1 has a spatial extension closely aligned with the main filament and is connected to the filament towards its both ends. M1 thus represents a very beginning state for a massive young star-forming core escaping from the parental filament, within a time scale of $\sim 4000$ years. Based on its kinetic energy ($3.5\times10^{44}$ erg), the core escape is unlikely solely due to the original filament motion or magnetic field, but requires more energetic events such as a rapid intense anisotropic collapse. The released energy also seems to noticeably increase the environmental turbulence. This may help the filament to become stabilized again.

astro-ph.GA↗