Search

Multiterminal Josephson junctions are a promising platform to host synthetic topological phases of matter and Floquet states. However, the energy scales governing topological protection in these devices are on the order of the spacing between Andreev bound states. Recent theories suggest that similar phenomena may instead be explored in circuits composed of two-terminal Josephson junctions, allowing for the topological protection to be controlled by the comparatively large Josephson energy. Here, we explore a Josephson circuit, in which three superconducting electrodes are connected through Josephson junctions to a common superconducting island. We demonstrate the dynamic generation of multiplet resonances, which have previously been observed in multiterminal Josephson junctions. The multiplets are found to be robust to elevated temperatures and are confirmed by exhibiting the expected Shapiro step quantization under a microwave drive. We also find an unexpected novel supercurrent, which couples a pair of contacts that are both voltage-biased with respect to the common superconducting island. We show that this supercurrent results from synchronization of the phase dynamics and pose the question whether it should also carry a topological contribution.

Sequential recommendation systems fundamentally rely on users' historical interaction sequences, which are often contaminated by noisy interactions. Identifying these noisy interactions accurately without additional information is particularly difficult due to the lack of explicit supervisory signals to denote noise. Large Language Models (LLMs), equipped with extensive open knowledge and semantic reasoning abilities, present a promising avenue to bridge this information gap. However, employing LLMs for denoising in sequential recommendation introduces notable challenges: 1) Direct application of pretrained LLMs may not be competent for the denoising task, frequently generating nonsensical responses; 2) Even after fine-tuning, the reliability of LLM outputs remains questionable, especially given the complexity of the task and th inherent hallucinatory issue of LLMs. To tackle these challenges, we propose LLM4DSR, a tailored approach for denoising sequential recommendation using LLMs. We constructed a self-supervised fine-tuning task to activate LLMs' capabilities to identify noisy items and suggest replacements. Furthermore, we developed an uncertainty estimation module that ensures only high-confidence responses are utilized for sequence corrections. Remarkably, LLM4DSR is model-agnostic, allowing the corrected sequences to be flexibly applied across various recommendation models. Extensive experiments validate the superiority of LLM4DSR over existing methods across three datasets and three recommendation backbones.

Recent research on knowledge distillation has increasingly focused on logit distillation because of its simplicity, effectiveness, and versatility in model compression. In this paper, we introduce Refined Logit Distillation (RLD) to address the limitations of current logit distillation methods. Our approach is motivated by the observation that even high-performing teacher models can make incorrect predictions, creating a conflict between the standard distillation loss and the cross-entropy loss. This conflict can undermine the consistency of the student model's learning objectives. Previous attempts to use labels to empirically correct teacher predictions may undermine the class correlation. In contrast, our RLD employs labeling information to dynamically refine teacher logits. In this way, our method can effectively eliminate misleading information from the teacher while preserving crucial class correlations, thus enhancing the value and efficiency of distilled knowledge. Experimental results on CIFAR-100 and ImageNet demonstrate its superiority over existing methods. The code is provided at \text{https://github.com/zju-SWJ/RLD}., Comment: 11 pages, 7 figures

In this paper, we present an enhanced semi-analytic method for calculating quasinormal excitation factors in the eikonal regime, specifically for Schwarzschild black holes. To achieve improved accuracy in our quasinormal mode computations, we extend the Dolan and Ottewill inverse multipolar expansion technique and incorporate higher-order corrections from the WKB method of Iyer and Will. Our approach is carried out to a higher order than previous methods, thereby reducing the relative error, particularly for lower multipolar numbers. We validate our results by comparing them with those obtained using the Mano, Suzuki, and Takasugi method, demonstrating excellent agreement. A key advantage of our method is its ability to extract quasinormal excitation factors, which are crucial for accurately modeling gravitational wave signals from binary black hole mergers. This advancement provides a useful tool for future gravitational wave studies, enabling better quantification of quasinormal mode excitations and more precise identification of individual modes during black hole ringdowns., Comment: 32 pages, 4 figures, 3 tables, and 2 appendices

Learning effective representations for Continuous-Time Dynamic Graphs (CTDGs) has garnered significant research interest, largely due to its powerful capabilities in modeling complex interactions between nodes. A fundamental and crucial requirement for representation learning in CTDGs is the appropriate estimation and preservation of proximity. However, due to the sparse and evolving characteristics of CTDGs, the spatial-temporal properties inherent in high-order proximity remain largely unexplored. Despite its importance, this property presents significant challenges due to the computationally intensive nature of personalized interaction intensity estimation and the dynamic attributes of CTDGs. To this end, we propose a novel Correlated Spatial-Temporal Positional encoding that incorporates a parameter-free personalized interaction intensity estimation under the weak assumption of the Poisson Point Process. Building on this, we introduce the Dynamic Graph Transformer with \Correlated Spatial-Temporal Positional Encoding (CorDGT), which efficiently retains the evolving spatial-temporal high-order proximity for effective node representation learning in CTDGs. Extensive experiments on seven small and two large-scale datasets demonstrate the superior performance and scalability of the proposed CorDGT.

Wavefront shaping has become a powerful tool for manipulating light propagation in various complex media undergoing linear scattering. Controlling nonlinear optical interactions with spatial degrees of freedom is a relatively recent but growing area of research. A wavefront-shaping-based approach can be used to suppress nonlinear stimulated Brillouin scattering (SBS) and transverse mode instability (TMI), which are the two main limitations to power scaling in high-power narrowband fiber amplifiers. Here we formulate both SBS and TMI suppression as optimization problems with respect to coherent multimode input excitation in a given multimode fiber. We develop an efficient method for finding the globally optimal input excitation for SBS and TMI suppression using linear programming. We theoretically show that optimally exciting a standard multimode fiber leads to roughly an order of magnitude enhancement in output power limited by SBS and TMI, compared to fundamental-mode-only excitation. We find that the optimal mode content is robust to small perturbations and our approach works even in the presence of mode dependent loss and gain. Optimal mode content can be excited in real experiments using spatial light modulators, creating a novel platform for instability-free ultrahigh-power fiber lasers., Comment: 13 pages, 7 figures

We demonstrate sub-recoil Sisyphus cooling using the long-lived $^{3}\mathrm{P}_{0}$ clock state in alkaline-earth-like ytterbium. A 1388 nm optical standing wave nearly resonant with the $^{3}\textrm{P}_{0}$$\,\rightarrow$$\,^{3}\textrm{D}_{1}$ transition creates a spatially periodic light shift of the $^{3}\textrm{P}_{0}$ clock state. Following excitation on the ultranarrow clock transition, we observe Sisyphus cooling in this potential, as the light shift is correlated with excitation to $^{3}\textrm{D}_{1}$ and subsequent spontaneous decay to the $^{1}\textrm{S}_{0}$ ground state. We observe that cooling enhances the loading efficiency of atoms into a 759 nm magic-wavelength one-dimensional (1D) optical lattice, as compared to standard Doppler cooling on the $^{1}\textrm{S}_{0}$$\,\rightarrow\,$$^{3}\textrm{P}_{1}$ transition. Sisyphus cooling yields temperatures below 200 nK in the weakly confined, transverse dimensions of the 1D optical lattice. These lower temperatures improve optical lattice clocks by facilitating the use of shallow lattices with reduced light shifts, while retaining large atom numbers to reduce the quantum projection noise. This Sisyphus cooling can be pulsed or continuous and is applicable to a range of quantum metrology applications., Comment: 8 pages, 6 figures

To mitigate the suboptimal nature of graph structure, Graph Structure Learning (GSL) has emerged as a promising approach to improve graph structure and boost performance in downstream tasks. Despite the proposal of numerous GSL methods, the progresses in this field mostly concentrated on node-level tasks, while graph-level tasks (e.g., graph classification) remain largely unexplored. Notably, applying node-level GSL to graph classification is non-trivial due to the lack of find-grained guidance for intricate structure learning. Inspired by the vital role of subgraph in graph classification, in this paper we explore the potential of subgraph structure learning for graph classification by tackling the challenges of key subgraph selection and structure optimization. We propose a novel Motif-driven Subgraph Structure Learning method for Graph Classification (MOSGSL). Specifically, MOSGSL incorporates a subgraph structure learning module which can adaptively select important subgraphs. A motif-driven structure guidance module is further introduced to capture key subgraph-level structural patterns (motifs) and facilitate personalized structure learning. Extensive experiments demonstrate a significant and consistent improvement over baselines, as well as its flexibility and generalizability for various backbones and learning procedures., Comment: 16 pages, 8 figures

The Fermi Gamma-Ray Space Telescope reveals two large bubbles in the Galaxy, extending nearly symmetrically $\sim50^{\circ}$ above and below the Galactic center (GC). Previous simulations of bubble formation invoking active galactic nucleus (AGN) jets have assumed that the jets are vertical to the Galactic disk; however, in general, the jet orientation does not necessarily correlate with the rotational axis of the Galactic disk. Using three-dimensional special relativistic hydrodynamic simulations including cosmic rays (CRs) and thermal gas, we show that the dense clumpy gas within the Galactic disk disrupts jet collimation ("failed jets" hereafter), which causes the failed jets to form hot bubbles. Subsequent buoyancy in the stratified atmosphere renders them vertical to form the symmetric Fermi and eROSITA bubbles (collectively, Galactic bubbles). We find that (1) despite the relativistic jets emanated from the GC are at various angles $\le45^{\circ}$ with respect to the rotational axis of the Galaxy, the Galactic bubbles nonetheless appear aligned with the axis; (2) the edge of the eROSITA bubbles corresponds to a forward shock driven by the hot bubbles; (3) followed by the forward shock is a tangling contact discontinuity corresponding to the edge of the Fermi bubbles; (4) assuming a leptonic model we find that the observed gamma-ray bubbles and microwave haze can be reproduced with a best-fit CR power-law spectral index of 2.4; The agreements between the simulated and the observed multi-wavelength features suggest that forming the Galactic bubbles by oblique AGN failed jets is a plausible scenario., Comment: 29 pages, 18 figures

The recent rapid advancements in both sensing and machine learning technologies have given rise to the universal collection and utilization of people's biometrics, such as fingerprints, voices, retina/facial scans, or gait/motion/gestures data, enabling a wide range of applications including authentication, health monitoring, or much more sophisticated analytics. While providing better user experiences and deeper business insights, the use of biometrics has raised serious privacy concerns due to their intrinsic sensitive nature and the accompanying high risk of leaking sensitive information such as identity or medical conditions. In this paper, we propose a novel modality-agnostic data transformation framework that is capable of anonymizing biometric data by suppressing its sensitive attributes and retaining features relevant to downstream machine learning-based analyses that are of research and business values. We carried out a thorough experimental evaluation using publicly available facial, voice, and motion datasets. Results show that our proposed framework can achieve a \highlight{high suppression level for sensitive information}, while at the same time retain underlying data utility such that subsequent analyses on the anonymized biometric data could still be carried out to yield satisfactory accuracy., Comment: Preprint of IJIS version, https://link.springer.com/article/10.1007/s10207-024-00862-8

The growing richness of large-scale datasets has been crucial in driving the rapid advancement and wide adoption of machine learning technologies. The massive collection and usage of data, however, pose an increasing risk for people's private and sensitive information due to either inadvertent mishandling or malicious exploitation. Besides legislative solutions, many technical approaches have been proposed towards data privacy protection. However, they bear various limitations such as leading to degraded data availability and utility, or relying on heuristics and lacking solid theoretical bases. To overcome these limitations, we propose a formal information-theoretic definition for this utility-preserving privacy protection problem, and design a data-driven learnable data transformation framework that is capable of selectively suppressing sensitive attributes from target datasets while preserving the other useful attributes, regardless of whether or not they are known in advance or explicitly annotated for preservation. We provide rigorous theoretical analyses on the operational bounds for our framework, and carry out comprehensive experimental evaluations using datasets of a variety of modalities, including facial images, voice audio clips, and human activity motion sensor signals. Results demonstrate the effectiveness and generalizability of our method under various configurations on a multitude of tasks. Our code is available at https://github.com/jpmorganchase/MaSS., Comment: ICML 2024, GitHub: https://github.com/jpmorganchase/MaSS

Recommendation Systems (RS) are often plagued by popularity bias. When training a recommendation model on a typically long-tailed dataset, the model tends to not only inherit this bias but often exacerbate it, resulting in over-representation of popular items in the recommendation lists. This study conducts comprehensive empirical and theoretical analyses to expose the root causes of this phenomenon, yielding two core insights: 1) Item popularity is memorized in the principal spectrum of the score matrix predicted by the recommendation model; 2) The dimension collapse phenomenon amplifies the relative prominence of the principal spectrum, thereby intensifying the popularity bias. Building on these insights, we propose a novel debiasing strategy that leverages a spectral norm regularizer to penalize the magnitude of the principal singular value. We have developed an efficient algorithm to expedite the calculation of the spectral norm by exploiting the spectral property of the score matrix. Extensive experiments across seven real-world datasets and three testing paradigms have been conducted to validate the superiority of the proposed method., Comment: 23 pages, 9 figures

This paper addresses text-supervised semantic segmentation, aiming to learn a model capable of segmenting arbitrary visual concepts within images by using only image-text pairs without dense annotations. Existing methods have demonstrated that contrastive learning on image-text pairs effectively aligns visual segments with the meanings of texts. We notice that there is a discrepancy between text alignment and semantic segmentation: A text often consists of multiple semantic concepts, whereas semantic segmentation strives to create semantically homogeneous segments. To address this issue, we propose a novel framework, Image-Text Co-Decomposition (CoDe), where the paired image and text are jointly decomposed into a set of image regions and a set of word segments, respectively, and contrastive learning is developed to enforce region-word alignment. To work with a vision-language model, we present a prompt learning mechanism that derives an extra representation to highlight an image segment or a word segment of interest, with which more effective features can be extracted from that segment. Comprehensive experimental results demonstrate that our method performs favorably against existing text-supervised semantic segmentation methods on six benchmark datasets., Comment: CVPR 2024

With the capacity to capture high-order collaborative signals, Graph Neural Networks (GNNs) have emerged as powerful methods in Recommender Systems (RS). However, their efficacy often hinges on the assumption that training and testing data share the same distribution (a.k.a. IID assumption), and exhibits significant declines under distribution shifts. Distribution shifts commonly arises in RS, often attributed to the dynamic nature of user preferences or ubiquitous biases during data collection in RS. Despite its significance, researches on GNN-based recommendation against distribution shift are still sparse. To bridge this gap, we propose Distributionally Robust GNN (DR-GNN) that incorporates Distributional Robust Optimization (DRO) into the GNN-based recommendation. DR-GNN addresses two core challenges: 1) To enable DRO to cater to graph data intertwined with GNN, we reinterpret GNN as a graph smoothing regularizer, thereby facilitating the nuanced application of DRO; 2) Given the typically sparse nature of recommendation data, which might impede robust optimization, we introduce slight perturbations in the training distribution to expand its support. Notably, while DR-GNN involves complex optimization, it can be implemented easily and efficiently. Our extensive experiments validate the effectiveness of DR-GNN against three typical distribution shifts. The code is available at https://github.com/WANGBohaO-jpg/DR-GNN., Comment: Accepted by WWW2024

Time-reversal symmetry enables shaping input waves to control output waves in many linear and nonlinear systems; however energy dissipation violates such symmetry. We consider a saturated multimode fiber amplifier in which light generates heat flow and suffers nonlinear thermo-optical scattering, breaking time-reversal symmetry. We identify a spacetime symmetry which maps the target output back to an input field. This mapping employs phase conjugation, gain and absorption substitution but not time reversal, and holds in steady-state and for slowly varying inputs. Our results open the possibility of output control of a saturated multimode fiber amplifier.

We implement coherent delocalization as a tool for improving the two primary metrics of atomic clock performance: systematic uncertainty and instability. By decreasing atomic density with coherent delocalization, we suppress cold-collision shifts and two-body losses. Atom loss attributed to Landau-Zener tunneling in the ground lattice band would compromise coherent delocalization at low trap depths for our $^{171}$Yb atoms; hence, we implement for the first time delocalization in excited lattice bands. Doing so increases the spatial distribution of atoms trapped in the vertically-oriented optical lattice by $\sim7$ times. At the same time we observe a reduction of the cold-collision shift by 6.5(8) times, while also making inelastic two-body loss negligible. With these advantages, we measure the trap-light-induced quenching rate and natural lifetime of the ${}^3$P${}_0$ excited-state as $5.7(7)\times10^{-4}$ $E_r^{-1}s^{-1}$ and 19(2) s, respectively.

Recent works have shown that by using large pre-trained models along with learnable prompts, rehearsal-free methods for class-incremental learning (CIL) settings can achieve superior performance to prominent rehearsal-based ones. Rehearsal-free CIL methods struggle with distinguishing classes from different tasks, as those are not trained together. In this work we propose a regularization method based on virtual outliers to tighten decision boundaries of the classifier, such that confusion of classes among different tasks is mitigated. Recent prompt-based methods often require a pool of task-specific prompts, in order to prevent overwriting knowledge of previous tasks with that of the new task, leading to extra computation in querying and composing an appropriate prompt from the pool. This additional cost can be eliminated, without sacrificing accuracy, as we reveal in the paper. We illustrate that a simplified prompt-based method can achieve results comparable to previous state-of-the-art (SOTA) methods equipped with a prompt pool, using much less learnable parameters and lower inference cost. Our regularization method has demonstrated its compatibility with different prompt-based methods, boosting those previous SOTA rehearsal-free CIL methods' accuracy on the ImageNet-R and CIFAR-100 benchmarks. Our source code is available at https://github.com/jpmorganchase/ovor., Comment: Accepted by ICLR 2024

Machine unlearning has emerged as a new paradigm to deliberately forget data samples from a given model in order to adhere to stringent regulations. However, existing machine unlearning methods have been primarily focused on classification models, leaving the landscape of unlearning for generative models relatively unexplored. This paper serves as a bridge, addressing the gap by providing a unifying framework of machine unlearning for image-to-image generative models. Within this framework, we propose a computationally-efficient algorithm, underpinned by rigorous theoretical analysis, that demonstrates negligible performance degradation on the retain samples, while effectively removing the information from the forget samples. Empirical studies on two large-scale datasets, ImageNet-1K and Places-365, further show that our algorithm does not rely on the availability of the retain samples, which further complies with data retention policy. To our best knowledge, this work is the first that represents systemic, theoretical, empirical explorations of machine unlearning specifically tailored for image-to-image generative models. Our code is available at https://github.com/jpmorganchase/l2l-generator-unlearning., Comment: ICLR 2024

We treat disordered Heisenberg model in 1D as the "standard model" of many-body localization (MBL). Two independent order parameters stemming purely from the half-chain von Neumann entanglement entropy $S_{\textrm{vN}}$ are introduced to probe its eigenstate transition. From symmetry-endowed entropy decomposition, they are probability distribution deviation $|d(p_n)|$ and von Neumann entropy $S_{\textrm{vN}}^{n}(D_n\!=\!\mbox{max})$ of the maximum-dimensional symmetry subdivision. Finite-size analyses reveal that $\{p_n\}$ drives the localization transition, preceded by a thermalization breakdown transition governed by $\{S_{\textrm{vN}}^{n}\}$. For noninteracting case, these transitions coincide, but in interacting situation they separate. Such separability creates an intermediate phase region and may help discriminate between the Anderson and MBL transitions. An obstacle whose solution eludes community to date is the violation of Harris criterion in nearly all numeric investigations of MBL so far. Upon elucidating the mutually independent components in $S_{\textrm{vN}}$, it is clear that previous studies of eigenspectra, $S_{\textrm{vN}}$, and the like lack resolution to pinpoint (thus completely overlook) the crucial internal structures of the transition. We show, for the first time, that after this necessary decoupling, the universal critical exponents for both transitions of $|d(p_n)|$ and $S_{\textrm{vN}}^{n}(D_n\!=\!\mbox{max})$ fulfill the Harris criterion: $\nu\approx2.0\ (\nu\approx1.5)$ for quench (quasirandom) disorder. Our work puts forth "symmetry combined with entanglement" as the missing organization principle for the generic eigenstate matter and transition.

Deep learning has witnessed significant advancements in recent years at the cost of increasing training, inference, and model storage overhead. While existing model compression methods strive to reduce the number of model parameters while maintaining high accuracy, they inevitably necessitate the re-training of the compressed model or impose architectural constraints. To overcome these limitations, this paper presents a novel framework, termed \textbf{K}nowledge \textbf{T}ranslation (KT), wherein a ``translation'' model is trained to receive the parameters of a larger model and generate compressed parameters. The concept of KT draws inspiration from language translation, which effectively employs neural networks to convert different languages, maintaining identical meaning. Accordingly, we explore the potential of neural networks to convert models of disparate sizes, while preserving their functionality. We propose a comprehensive framework for KT, introduce data augmentation strategies to enhance model performance despite restricted training data, and successfully demonstrate the feasibility of KT on the MNIST dataset. Code is available at \url{https://github.com/zju-SWJ/KT}.

The rapid growth of machine learning has spurred legislative initiatives such as ``the Right to be Forgotten,'' allowing users to request data removal. In response, ``machine unlearning'' proposes the selective removal of unwanted data without the need for retraining from scratch. While the Neural-Tangent-Kernel-based (NTK-based) unlearning method excels in performance, it suffers from significant computational complexity, especially for large-scale models and datasets. Our work introduces ``Fast-NTK,'' a novel NTK-based unlearning algorithm that significantly reduces the computational complexity by incorporating parameter-efficient fine-tuning methods, such as fine-tuning batch normalization layers in a CNN or visual prompts in a vision transformer. Our experimental results demonstrate scalability to much larger neural networks and datasets (e.g., 88M parameters; 5k images), surpassing the limitations of previous full-model NTK-based approaches designed for smaller cases (e.g., 8M parameters; 500 images). Notably, our approach maintains a performance comparable to the traditional method of retraining on the retain set alone. Fast-NTK can thus enable for practical and scalable NTK-based unlearning in deep neural networks., Comment: 6 pages, 1 figure

Sampling from diffusion models can be treated as solving the corresponding ordinary differential equations (ODEs), with the aim of obtaining an accurate solution with as few number of function evaluations (NFE) as possible. Recently, various fast samplers utilizing higher-order ODE solvers have emerged and achieved better performance than the initial first-order one. However, these numerical methods inherently result in certain approximation errors, which significantly degrades sample quality with extremely small NFE (e.g., around 5). In contrast, based on the geometric observation that each sampling trajectory almost lies in a two-dimensional subspace embedded in the ambient space, we propose Approximate MEan-Direction Solver (AMED-Solver) that eliminates truncation errors by directly learning the mean direction for fast diffusion sampling. Besides, our method can be easily used as a plugin to further improve existing ODE-based samplers. Extensive experiments on image synthesis with the resolution ranging from 32 to 512 demonstrate the effectiveness of our method. With only 5 NFE, we achieve 6.61 FID on CIFAR-10, 10.74 FID on ImageNet 64$\times$64, and 13.20 FID on LSUN Bedroom. Our code is available at https://github.com/zju-pi/diff-sampler., Comment: Accepted by CVPR 2024

We present a faster repumping scheme for strontium magneto-optical traps operating on the broad ${\mathrm{5s^2} ^1\mathrm{S}_0} - {\mathrm{5s5p} ^1\mathrm{P}_1}$ laser cooling transition. Contrary to existing repumping schemes, we directly address lost atoms that spontaneously decayed to the ${\mathrm{5s4d} ^1\mathrm{D}_2}$ state, sending them back into the laser cooling cycle by optical pumping on the ${\mathrm{5s4d} ^1\mathrm{D}_2} - {\mathrm{5s8p} ^1\mathrm{P}_1}$ transition. We thus avoid the $\sim 100 \, \mathrm{\mu s}$-slow decay path from ${\mathrm{5s4d} ^1\mathrm{D}_2}$ to the ${\mathrm{5s5p} ^3\mathrm{P}_{1,2}}$ states that is part of other repumping schemes. Using one low-cost external-cavity diode laser emitting at $448 \, \mathrm{nm}$, we show our scheme increases the flux out of a 2D magneto-optical trap by $60 \, \%$ compared to without repumping. Furthermore, we perform spectroscopy on the ${\mathrm{5s4d} ^1\mathrm{D}_2} - {\mathrm{5s8p} ^1\mathrm{P}_1}$ transition and measure its frequency $\nu_{\mathrm{^{88}Sr}} = (668917515.3 \pm 4.0 \pm 25) \, \mathrm{MHz}$. We also measure the frequency shifts between the four stable isotopes of strontium and infer the specific mass and field shift factors, $\delta \nu_\text{SMS} ^{88,86} = -267(45) \, \mathrm{MHz}$ and $\delta \nu_\text{FS} ^{88,86} = 2(42) \, \mathrm{MHz}$. Finally, we measure the hyperfine splitting of the ${\mathrm{5s8p} ^1\mathrm{P}_1}$ state in fermionic strontium, and deduce the magnetic dipole and electric quadrupole coupling coefficients $A = -4(5) \, \mathrm{MHz}$ and $B = 5(35) \, \mathrm{MHz}$. Our experimental demonstration shows that this simple and very fast scheme could improve the laser cooling and imaging performance of cold strontium atom devices, such as quantum computers based on strontium atoms in arrays of optical tweezers., Comment: 10 pages, 5 figures

Transverse Mode Instability (TMI) which results from dynamic nonlinear thermo-optical scattering is the primary limitation to power scaling in high-power fiber lasers and amplifiers. It has been proposed that TMI can be suppressed by exciting multiple modes in a highly multimode fiber. We derive a semi-analytic frequency-domain theory of the threshold for the onset of TMI under arbitrary multimode input excitation for general fiber geometries. We show that TMI results from exponential growth of noise in all the modes at downshifted frequencies due to the thermo-optical coupling. The noise growth rate in each mode is given by the sum of signal powers in various modes weighted by pairwise thermo-optical coupling coefficients. We calculate thermo-optical coupling coefficients for all $\sim$$10^4$ pairs of modes in a standard circular multimode fiber and show that modes with large transverse spatial frequency mismatch are weakly coupled resulting in a banded coupling matrix. This short-range behavior is due to the diffusive nature of the heat propagation which mediates the coupling and leads to a lower noise growth rate upon multimode excitation compared to single mode, resulting in significant TMI suppression. We find that the TMI threshold increases linearly with the number of modes that are excited, leading to more than an order of magnitude increase in the TMI threshold in a 82-mode fiber amplifier. Using our theory, we also calculate TMI threshold in fibers with non-circular geometries upon multimode excitation and show the linear scaling of TMI threshold to be a universal property of different fibers.

In recommendation systems (RS), user behavior data is observational rather than experimental, resulting in widespread bias in the data. Consequently, tackling bias has emerged as a major challenge in the field of recommendation systems. Recently, Doubly Robust Learning (DR) has gained significant attention due to its remarkable performance and robust properties. However, our experimental findings indicate that existing DR methods are severely impacted by the presence of so-called Poisonous Imputation, where the imputation significantly deviates from the truth and becomes counterproductive. To address this issue, this work proposes Conservative Doubly Robust strategy (CDR) which filters imputations by scrutinizing their mean and variance. Theoretical analyses show that CDR offers reduced variance and improved tail bounds.In addition, our experimental investigations illustrate that CDR significantly enhances performance and can indeed reduce the frequency of poisonous imputation.

Graph Neural Networks have emerged as an effective machine learning tool for multi-disciplinary tasks such as pharmaceutical molecule classification and chemical reaction prediction, because they can model non-euclidean relationships between different entities. Particle crushing, as a significant field of civil engineering, describes the breakage of granular materials caused by the breakage of particle fragment bonds under the modeling of numerical simulations, which motivates us to characterize the mechanical behaviors of particle crushing through the connectivity of particle fragments with Graph Neural Networks (GNNs). However, there lacks an open-source large-scale particle crushing dataset for research due to the expensive costs of laboratory tests or numerical simulations. Therefore, we firstly generate a dataset with 45,000 numerical simulations and 900 particle types to facilitate the research progress of machine learning for particle crushing. Secondly, we devise a hybrid framework based on GNNs to predict particle crushing strength in a particle fragment view with the advances of state of the art GNNs. Finally, we compare our hybrid framework against traditional machine learning methods and the plain MLP to verify its effectiveness. The usefulness of different features is further discussed through the gradient attribution explanation w.r.t the predictions. Our data and code are released at https://github.com/doujiang-zheng/GNN-For-Particle-Crushing.

Graph Neural Networks (GNNs) have emerged as the de facto standard for representation learning on graphs, owing to their ability to effectively integrate graph topology and node attributes. However, the inherent suboptimal nature of node connections, resulting from the complex and contingent formation process of graphs, presents significant challenges in modeling them effectively. To tackle this issue, Graph Structure Learning (GSL), a family of data-centric learning approaches, has garnered substantial attention in recent years. The core concept behind GSL is to jointly optimize the graph structure and the corresponding GNN models. Despite the proposal of numerous GSL methods, the progress in this field remains unclear due to inconsistent experimental protocols, including variations in datasets, data processing techniques, and splitting strategies. In this paper, we introduce OpenGSL, the first comprehensive benchmark for GSL, aimed at addressing this gap. OpenGSL enables a fair comparison among state-of-the-art GSL methods by evaluating them across various popular datasets using uniform data processing and splitting strategies. Through extensive experiments, we observe that existing GSL methods do not consistently outperform vanilla GNN counterparts. We also find that there is no significant correlation between the homophily of the learned structure and task performance, challenging the common belief. Moreover, we observe that the learned graph structure demonstrates a strong generalization ability across different GNN models, despite the high computational and space consumption. We hope that our open-sourced library will facilitate rapid and equitable evaluation and inspire further innovative research in this field. The code of the benchmark can be found in https://github.com/OpenGSL/OpenGSL., Comment: 25 pages, 21 figures. Camera-ready version for NeurIPS Datasets and Benchmarks Track 2023

Criticality is hypothesized as a physical mechanism underlying efficient transitions between cortical states and remarkable information processing capacities in the brain. While considerable evidence generally supports this hypothesis, non-negligible controversies persist regarding the ubiquity of criticality in neural dynamics and its role in information processing. Validity issues frequently arise during identifying potential brain criticality from empirical data. Moreover, the functional benefits implied by brain criticality are frequently misconceived or unduly generalized. These problems stem from the non-triviality and immaturity of the physical theories that analytically derive brain criticality and the statistic techniques that estimate brain criticality from empirical data. To help solve these problems, we present a systematic review and reformulate the foundations of studying brain criticality, i.e., ordinary criticality (OC), quasi-criticality (qC), self-organized criticality (SOC), and self-organized quasi-criticality (SOqC), using the terminology of neuroscience. We offer accessible explanations of the physical theories and statistic techniques of brain criticality, providing step-by-step derivations to characterize neural dynamics as a physical system with avalanches. We summarize error-prone details and existing limitations in brain criticality analysis and suggest possible solutions. Moreover, we present a forward-looking perspective on how optimizing the foundations of studying brain criticality can deepen our understanding of various neuroscience questions.

Recent years have witnessed significant progress in developing effective training and fast sampling techniques for diffusion models. A remarkable advancement is the use of stochastic differential equations (SDEs) and their marginal-preserving ordinary differential equations (ODEs) to describe data perturbation and generative modeling in a unified framework. In this paper, we carefully inspect the ODE-based sampling of a popular variance-exploding SDE and reveal several intriguing structures of its sampling dynamics. We discover that the data distribution and the noise distribution are smoothly connected with a quasi-linear sampling trajectory and another implicit denoising trajectory that even converges faster. Meanwhile, the denoising trajectory governs the curvature of the corresponding sampling trajectory and its finite differences yield various second-order samplers used in practice. Furthermore, we establish a theoretical relationship between the optimal ODE-based sampling and the classic mean-shift (mode-seeking) algorithm, with which we can characterize the asymptotic behavior of diffusion models and identify the empirical score deviation. Code is available at \url{https://github.com/zju-pi/diff-sampler}., Comment: 38 pages

The key challenge for high-power delivery through optical fibers is overcoming nonlinear optical effects. To keep a smooth output beam, most techniques for mitigating optical nonlinearities are restricted to single-mode fibers. Moving out of the single-mode paradigm, we show experimentally that wavefront-shaping of coherent input light that is incident on a highly multimode fiber can increase the power threshold for stimulated Brillouin scattering (SBS) by an order of magnitude, whilst simultaneously controlling the output beam profile. The theory reveals that the suppression of SBS is due to the relative weakness of intermodal scattering compared to intramodal scattering, and to an effective broadening of the Brillouin spectrum under multimode excitation. Our method is efficient, robust, and applicable to continuous waves and pulses. This work points toward a promising route for suppressing detrimental nonlinear effects in optical fibers, which will enable further power scaling of high-power fiber systems for applications to directed energy, remote sensing, and gravitational-wave detection.

Stimulated Brillouin scattering (SBS) is an important nonlinear optical effect which can both enable and impede optical processes in guided wave systems. Highly multi-mode excitation of fibers has been proposed as a novel route towards efficient suppression of SBS in both active and passive fibers. To study the effects of multimode excitation generally, we develop a theory of SBS for arbitrary input excitations, fiber cross section geometries and refractive index profiles. We derive appropriate nonlinear coupled mode equations for the signal and Stokes modal amplitudes starting from vector optical and tensor acoustic equations. Using applicable approximations, we find an analytical formula for the SBS (Stokes) gain susceptibility, which takes into account the vector nature of both optical and acoustic modes exactly. We show that upon multimode excitation, the SBS power in each Stokes mode grows exponentially with a growth rate that depends parametrically on the distribution of power in the signal modes. Specializing to isotropic fibers we are able to define and calculate an effective SBS gain spectrum for any choice of multimode excitation. The peak value of this gain spectrum determines the SBS threshold, the maximum SBS-limited power that can be sent through the fiber. We show theoretically that peak SBS gain is greatly reduced by highly multimode excitation due to gain broadening and relatively weaker intermodal SBS gain. We demonstrate that equal excitation of the 160 modes of a commercially available, highly multimode circular step index fiber raises the SBS threshold by a factor of 6.5, and find comparable suppression of SBS in similar fibers with a D-shaped cross-section.

Temporal graphs exhibit dynamic interactions between nodes over continuous time, whose topologies evolve with time elapsing. The whole temporal neighborhood of nodes reveals the varying preferences of nodes. However, previous works usually generate dynamic representation with limited neighbors for simplicity, which results in both inferior performance and high latency of online inference. Therefore, in this paper, we propose a novel method of temporal graph convolution with the whole neighborhood, namely Temporal Aggregation and Propagation Graph Neural Networks (TAP-GNN). Specifically, we firstly analyze the computational complexity of the dynamic representation problem by unfolding the temporal graph in a message-passing paradigm. The expensive complexity motivates us to design the AP (aggregation and propagation) block, which significantly reduces the repeated computation of historical neighbors. The final TAP-GNN supports online inference in the graph stream scenario, which incorporates the temporal information into node embeddings with a temporal activation function and a projection layer besides several AP blocks. Experimental results on various real-life temporal networks show that our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency. Our code is available at \url{https://github.com/doujiang-zheng/TAP-GNN}., Comment: Published by IEEE Transactions on Knowledge and Data Engineering, April 2023. We have updated the latest experimental results of baselines

Researchers of temporal networks (e.g., social networks and transaction networks) have been interested in mining dynamic patterns of nodes from their diverse interactions. Inspired by recently powerful graph mining methods like skip-gram models and Graph Neural Networks (GNNs), existing approaches focus on generating temporal node embeddings sequentially with nodes' sequential interactions. However, the sequential modeling of previous approaches cannot handle the transition structure between nodes' neighbors with limited memorization capacity. Detailedly, an effective method for the transition structures is required to both model nodes' personalized patterns adaptively and capture node dynamics accordingly. In this paper, we propose a method, namely Transition Propagation Graph Neural Networks (TIP-GNN), to tackle the challenges of encoding nodes' transition structures. The proposed TIP-GNN focuses on the bilevel graph structure in temporal networks: besides the explicit interaction graph, a node's sequential interactions can also be constructed as a transition graph. Based on the bilevel graph, TIP-GNN further encodes transition structures by multi-step transition propagation and distills information from neighborhoods by a bilevel graph convolution. Experimental results over various temporal networks reveal the efficiency of our TIP-GNN, with at most 7.2\% improvements of accuracy on temporal link prediction. Extensive ablation studies further verify the effectiveness and limitations of the transition propagation module. Our code is available at \url{https://github.com/doujiang-zheng/TIP-GNN}., Comment: Published by IEEE Transactions on Neural Networks and Learning Systems, 2022

A common wisdom posits that transports of conserved quantities across clean nonintegrable quantum systems at high temperatures are diffusive when probed from the emergent hydrodynamic regime. We show that this empirical paradigm may alter if the strong interaction limit is taken. Using Krylov-typicality and purification matrix-product-state methods, we establish the following observations for the strongly interacting version of the mixed-field Ising chain, a nonintegrable lattice model imitating the experimental Rydberg blockade array. Given the strict projection owing to the infinite density-density repulsion $V$, the chain's energy transport in the presence of a transverse field $g$ is superdiffusive at infinite temperature featured by an anomalous scaling exponent $\frac{3}{4}$, indicating the existence of a novel dynamical universality class. Imposing, in addition, a growing longitudinal field $h$ causes a drastic factorization of the whole Hilbert space into smaller subsectors, evidenced by the spectral parsing of the eigenstate entanglement. Being a consequence of this approximate symmetry, a superdiffusion-to-ballistic transport transition arises at $h\approx g$. Interestingly, all the above results persist for large but finite interactions and temperatures, provided that the strongly interacting condition $g,h\ll k_\textrm{B}T\ll V$ is fulfilled. Our predictions are verifiable by current experimental facilities., Comment: 5 pages, 4 figures

A great deal of many-body localization (MBL) has been learnt from the one-dimensional (1D) spin or fermion systems where the carriers are sort of scatter particles. By ontrast, the situation when multiple interacting bosons are clustered in a random potential remains much unexplored, albeit highly demanded. By using the numerical quantum quench dynamics, we study the symmetry-resolved entanglement entropy in a disordered Bose-Hubbard (dBH) chain, concentrating on the two types of inhomogeneous initial states to target the lower- and the higher-energy section of its dynamical phase diagram. From time-evolving a line-shape initial product state, we discover a hidden order: the sudden formation of the entropy imbalance across the different symmetry sectors, resulting in an entanglement-channel wave (ECW). Intriguingly, ECW melts in the strong-disorder limit. We conjecture the melting of ECW and the freezing of CDW are duo traits inherent to the disorder-induced MBL. Relatedly, a channel-resolved reanalysis hints the previously observed double-log growth of the number entropy may not indicate the breakdown of MBL for scatter particles. Through further exploiting the dynamical consequences of loading bosons onto one site, a cluster localization unique to the BH-type models emerges at the weak disorders. Collectively, the unraveled entanglement structures and dynamics manifest the dBH model's richness from a jointly energy- and symmetry-resolved perspective.

In this paper, we study the \underline{R}obust \underline{o}ptimization for \underline{se}quence \underline{Net}worked \underline{s}ubmodular maximization (RoseNets) problem. We interweave the robust optimization with the sequence networked submodular maximization. The elements are connected by a directed acyclic graph and the objective function is not submodular on the elements but on the edges in the graph. Under such networked submodular scenario, the impact of removing an element from a sequence depends both on its position in the sequence and in the network. This makes the existing robust algorithms inapplicable. In this paper, we take the first step to study the RoseNets problem. We design a robust greedy algorithm, which is robust against the removal of an arbitrary subset of the selected elements. The approximation ratio of the algorithm depends both on the number of the removed elements and the network topology. We further conduct experiments on real applications of recommendation and link prediction. The experimental results demonstrate the effectiveness of the proposed algorithm., Comment: 12 pages, 14 figures, aaai2023 conference accepted

Learning image representations using synthetic data allows training neural networks without some of the concerns associated with real images, such as privacy and bias. Existing work focuses on a handful of curated generative processes which require expert knowledge to design, making it hard to scale up. To overcome this, we propose training with a large dataset of twenty-one thousand programs, each one generating a diverse set of synthetic images. These programs are short code snippets, which are easy to modify and fast to execute using OpenGL. The proposed dataset can be used for both supervised and unsupervised representation learning, and reduces the gap between pre-training with real and procedurally generated images by 38%., Comment: 29 pages, Accepted in the Conference on Neural Information Processing Systems 2022 (NeurIPS 2022)

Although diffusion model has shown great potential for generating higher quality images than GANs, slow sampling speed hinders its wide application in practice. Progressive distillation is thus proposed for fast sampling by progressively aligning output images of $N$-step teacher sampler with $N/2$-step student sampler. In this paper, we argue that this distillation-based accelerating method can be further improved, especially for few-step samplers, with our proposed \textbf{C}lassifier-based \textbf{F}eature \textbf{D}istillation (CFD). Instead of aligning output images, we distill teacher's sharpened feature distribution into the student with a dataset-independent classifier, making the student focus on those important features to improve performance. We also introduce a dataset-oriented loss to further optimize the model. Experiments on CIFAR-10 show the superiority of our method in achieving high quality and fast sampling. Code is provided at \url{https://github.com/zju-SWJ/RCFD}., Comment: Accepted by ICME 2023

The recent rapid advances in machine learning technologies largely depend on the vast richness of data available today, in terms of both the quantity and the rich content contained within. For example, biometric data such as images and voices could reveal people's attributes like age, gender, sentiment, and origin, whereas location/motion data could be used to infer people's activity levels, transportation modes, and life habits. Along with the new services and applications enabled by such technological advances, various governmental policies are put in place to regulate such data usage and protect people's privacy and rights. As a result, data owners often opt for simple data obfuscation (e.g., blur people's faces in images) or withholding data altogether, which leads to severe data quality degradation and greatly limits the data's potential utility. Aiming for a sophisticated mechanism which gives data owners fine-grained control while retaining the maximal degree of data utility, we propose Multi-attribute Selective Suppression, or MaSS, a general framework for performing precisely targeted data surgery to simultaneously suppress any selected set of attributes while preserving the rest for downstream machine learning tasks. MaSS learns a data modifier through adversarial games between two sets of networks, where one is aimed at suppressing selected attributes, and the other ensures the retention of the rest of the attributes via general contrastive loss as well as explicit classification metrics. We carried out an extensive evaluation of our proposed method using multiple datasets from different domains including facial images, voice audio, and video clips, and obtained promising results in MaSS' generalizability and capability of suppressing targeted attributes without negatively affecting the data's usability in other downstream ML tasks.

The fast blue optical transients (FBOTs) are a new population of extragalactic transients of unclear physical origin. A variety of mechanisms have been proposed including failed supernova explosion, shock interaction with a dense medium, young magnetar, accretion onto a compact object, and stellar tidal disruption event, but none is conclusive. Here we report the discovery of a possible X-ray quasi-periodicity signal with a period of $\sim$250 second (at a significance level of 99.76%) in the brightest FBOT AT2018cow through the analysis of XMM-Newton/PN data. The signal is independently detected at the same frequency in the average power density spectrum from data taken from the Swift telescope, with observations covering from 6 to 37 days after the optical discovery, though the significance level is lower (94.26%). This suggests that the QPO frequency may be stable over at least 1.1$\times$ 10$^{4}$ cycles. Assuming the $\sim$250 second QPO to be a scaled-down analogue of that typically seen in stellar mass black holes, a black hole mass of $\sim10^{3}-10^{5}$ solar masses could be inferred. The overall X-ray luminosity evolution could be modeled with the stellar tidal disruption by a black hole of $\sim10^4$ solar masses, providing a viable mechanism to produce AT2018cow. Our findings suggest that other bright FBOTs may also harbor intermediate-mass black holes., Comment: 18 pages, 10 figures. Accepted for publication in Research in Astronomy and Astrophysics

Superconducting diodes are proposed non-reciprocal circuit elements that should exhibit non-dissipative transport in one direction while being resistive in the opposite direction. Multiple examples of such devices have emerged in the past couple of years, however their efficiency is typically limited, and most of them require magnetic field to function. Here we present a device achieving efficiencies upwards of 90% while operating at zero field. Our samples consist of a network of three graphene Josephson junctions linked by a common superconducting island, to which we refer as a Josephson triode. The triode is tuned by applying a control current to one of the contacts, thereby breaking the time-reversal symmetry of the current flow. The triode's utility is demonstrated by rectifying a small (tens of nA amplitude) applied square wave. We speculate that devices of this type could be realistically employed in the modern quantum circuits., Comment: 11 pages, 9 figures

This paper reports on progress towards building an online language learning tool to provide learners with conversational experience by using dialog systems as conversation practice partners. Our system can adapt to users' language proficiency on the fly. We also provide automatic grammar error feedback to help users learn from their mistakes. According to our first adopters, our system is entertaining and useful. Furthermore, we will provide the learning technology community a large-scale conversation dataset on language learning and grammar correction. Our next step is to make our system more adaptive to user profile information by using reinforcement learning algorithms., Comment: Accepted to Learning @ Scale 2022

High-power fiber laser amplifiers have enabled an increasing range of applications in industry, medicine and defense. The power scaling for narrow-band amplifiers is currently limited by the transverse modal instability. Various techniques have been developed to suppress the instability in a single or few-mode fiber in order to output a clean, collimated beam. Here we propose to use a highly multimode fiber and equal modal excitation to suppress the thermo-optical nonlinearity and instability. Our numerical simulations and theoretical analysis predict a significant reduction of dynamic coupling among the fiber modes with such excitation. When the bandwidth of a coherent seed is narrower than the spectral correlation width of the multimode fiber, the amplified light maintains high spatial coherence and can be transformed to any target pattern or focused to a diffraction-limited spot by a spatial mask at either input or output end of the amplifier. Our method simultaneously achieves high average power, narrow spectral width, and good beam quality, which are desired for fiber amplifiers in many applications.

Problem definition: Personalized medicine (PM) seeks the best treatment for each patient among a set of available treatment methods. Since a specific treatment does not work well on all patients, traditionally, the best treatment was selected based on the doctor's personal experience and expertise, which is subject to human errors. In the meantime, stochastic models have been well developed in the literature for a lot of major diseases. This gives rise to a simulation-based solution for PM, which uses the simulation tool to evaluate the performance for pairs of treatment and patient biometric characteristics, and based on that, selects the best treatment for each patient characteristics. Methodology/results: In this research, we extend the ranking and selection (R&S) model in simulation-based decision making to solving PM. The biometric characteristics of a patient is treated as a context for R&S, and we call it contextual ranking and selection (CR&S). We consider two formulations of CR&S with small and large context spaces respectively and develop new techniques for solving them and identifying the rate-optimal budget allocation rules. Based on them, two selection algorithms are proposed, which can be shown to be numerically superior via a set of tests on abstract and real-world examples. Managerial implications: This research provides a systematic way of conducting simulation-based decision-making for PM. To improve the overall decision quality for the possible contexts, more simulation efforts should be devoted to contexts in which it is difficult to distinguish between the best treatment and non-best treatments, and our results quantify the optimal tradeoff of the simulation efforts between the pairs of contexts and treatments.

Designing better machine translation systems by considering auxiliary inputs such as images has attracted much attention in recent years. While existing methods show promising performance over the conventional text-only translation systems, they typically require paired text and image as input during inference, which limits their applicability to real-world scenarios. In this paper, we introduce a visual hallucination framework, called VALHALLA, which requires only source sentences at inference time and instead uses hallucinated visual representations for multimodal machine translation. In particular, given a source sentence an autoregressive hallucination transformer is used to predict a discrete visual representation from the input text, and the combined text and hallucinated representations are utilized to obtain the target translation. We train the hallucination transformer jointly with the translation transformer using standard backpropagation with cross-entropy losses while being guided by an additional loss that encourages consistency between predictions using either ground-truth or hallucinated visual representations. Extensive experiments on three standard translation datasets with a diverse set of language pairs demonstrate the effectiveness of our approach over both text-only baselines and state-of-the-art methods. Project page: http://www.svcl.ucsd.edu/projects/valhalla., Comment: CVPR 2022

Knowledge distillation aims to compress a powerful yet cumbersome teacher model into a lightweight student model without much sacrifice of performance. For this purpose, various approaches have been proposed over the past few years, generally with elaborately designed knowledge representations, which in turn increase the difficulty of model development and interpretation. In contrast, we empirically show that a simple knowledge distillation technique is enough to significantly narrow down the teacher-student performance gap. We directly reuse the discriminative classifier from the pre-trained teacher model for student inference and train a student encoder through feature alignment with a single $\ell_2$ loss. In this way, the student model is able to achieve exactly the same performance as the teacher model provided that their extracted features are perfectly aligned. An additional projector is developed to help the student encoder match with the teacher classifier, which renders our technique applicable to various teacher and student architectures. Extensive experiments demonstrate that our technique achieves state-of-the-art results at the modest cost of compression ratio due to the added projector., Comment: Accepted to CVPR-2022

We performed a citation analysis on the Web of Science publications consisting of more than 63 million articles and 1.45 billion citations on 254 subjects from 1981 to 2020. We proposed the Article's Scientific Prestige (ASP) metric and compared this metric to number of citations (#Cit) and journal grade in measuring the scientific impact of individual articles in the large-scale hierarchical and multi-disciplined citation network. In contrast to #Cit, ASP, that is computed based on the eigenvector centrality, considers both direct and indirect citations, and provides steady-state evaluation cross different disciplines. We found that ASP and #Cit are not aligned for most articles, with a growing mismatch amongst the less cited articles. While both metrics are reliable for evaluating the prestige of articles such as Nobel Prize winning articles, ASP tends to provide more persuasive rankings than #Cit when the articles are not highly cited. The journal grade, that is eventually determined by a few highly cited articles, is unable to properly reflect the scientific impact of individual articles. The number of references and coauthors are less relevant to scientific impact, but subjects do make a difference.

Analyzing air pollution data is challenging as there are various analysis focuses from different aspects: feature (what), space (where), and time (when). As in most geospatial analysis problems, besides high-dimensional features, the temporal and spatial dependencies of air pollution induce the complexity of performing analysis. Machine learning methods, such as dimensionality reduction, can extract and summarize important information of the data to lift the burden of understanding such a complicated environment. In this paper, we present a methodology that utilizes multiple machine learning methods to uniformly explore these aspects. With this methodology, we develop a visual analytic system that supports a flexible analysis workflow, allowing domain experts to freely explore different aspects based on their analysis needs. We demonstrate the capability of our system and analysis workflow supporting a variety of analysis tasks with multiple use cases., Comment: To appear in the Proceedings of IEEE PacificVis 2022

Topological mechanical metamaterials have been widely explored for their boundary states, which can be robustly isolated or transported in a controlled manner. However, such systems often require pre-configured design or complex active actuation for wave manipulation. Here, we present the possibility of in-situ transfer of topological boundary modes by leveraging the reconfigurability intrinsic in twisted origami lattices. In particular, we employ a dimer Kresling origami system consisting of unit cells with opposite chirality, which couples longitudinal and rotational degrees of freedom in elastic waves. The quasi-static twist imposed on the lattice alters the strain landscape of the lattice, thus significantly affecting the wave dispersion relations and the topology of the underling bands. This in turn facilitates an efficient topological state transfer from one edge to the other. This simple and practical approach of energy transfer in origami-inspired lattices can thus inspire a new class of efficient energy manipulation devices., Comment: 24 pages, 5 figures