Search

Ultrafast optical excitation of quantum materials has opened new frontiers for transiently inducing novel phases of matter, including magnetism, charge density waves, ferroelectricity, and superconductivity beyond the constraints of equilibrium thermodynamics. Triggering a transient topological order in a trivial semiconductor represents a key milestone, as it could provide an on-demand route to topological functionality for device applications. However, achieving a topologically nontrivial phase from a large-gap (~ 1 eV) semiconductor remains a major challenge, as substantial energy modification is required to invert the band gap. Here, we report the discovery of a thermally inaccessible, transient topological crystalline order in a sizable-gap (~ 0.8 eV) layered semiconductor, SnSe, through femtosecond above-gap excitation. Time- and angle-resolved photoemission spectroscopy reveals a Dirac-like linear dispersion forming within the band gap on a subpicosecond timescale. This transient state shows hallmark features of a reflection-invariant topological crystalline insulator, including a high Fermi velocity (2.5x10^5 m/s), multiple Dirac points located away from high-symmetry momenta, and independence from probe photon energy, persisting for several picoseconds even at room temperature. Our findings establish a nonequilibrium pathway to ultrafast topological order in a semiconductor, opening new avenues for optically driven spintronic and quantum information technologies., Comment: 24 pages, 4 figures

The adoption of EHRs has expanded opportunities to leverage data-driven algorithms in clinical care and research. A major bottleneck in effectively conducting multi-institutional EHR studies is the data heterogeneity across systems with numerous codes that either do not exist or represent different clinical concepts across institutions. The need for data privacy further limits the feasibility of including multi-institutional patient-level data required to study similarities and differences across patient subgroups. To address these challenges, we developed the GAME algorithm. Tested and validated across 7 institutions and 2 languages, GAME integrates data in several levels: (1) at the institutional level with knowledge graphs to establish relationships between codes and existing knowledge sources, providing the medical context for standard codes and their relationship to each other; (2) between institutions, leveraging language models to determine the relationships between institution-specific codes with established standard codes; and (3) quantifying the strength of the relationships between codes using a graph attention network. Jointly trained embeddings are created using transfer and federated learning to preserve data privacy. In this study, we demonstrate the applicability of GAME in selecting relevant features as inputs for AI-driven algorithms in a range of conditions, e.g., heart failure, rheumatoid arthritis. We then highlight the application of GAME harmonized multi-institutional EHR data in a study of Alzheimer's disease outcomes and suicide risk among patients with mental health disorders, without sharing patient-level data outside individual institutions.

Exceptional points (EPs), which arise from non-Hermitian systems, have been extensively investigated for the development of high-performance gyroscopes. However, operating a non-Hermitian gyroscope at high-order EP (HOEP) to achieve extreme performance requires strict and precise control of parameters. Here, we propose the design of an anti-parity-time (anti-PT) symmetric optical gyroscope operating at a fourth-order EP, achieving both ultra-sensitivity and high robustness. Our configuration exhibits eigenfrequency splitting two orders of magnitude higher than that of anti-PT gyroscopes operating at second-order EP. Furthermore, we demonstrate a significant reduction in angular random walk (ARW) under noise limits, compared to anti-parity symmetric gyroscopes based on second-order EP. Our results provide a novel approach for developing high-sensitivity rotation detection based on HOEPs.

Coordinating multiple agents to collaboratively maximize submodular functions in unpredictable environments is a critical task with numerous applications in machine learning, robot planning and control. The existing approaches, such as the OSG algorithm, are often hindered by their poor approximation guarantees and the rigid requirement for a fully connected communication graph. To address these challenges, we firstly present a $\textbf{MA-OSMA}$ algorithm, which employs the multi-linear extension to transfer the discrete submodular maximization problem into a continuous optimization, thereby allowing us to reduce the strict dependence on a complete graph through consensus techniques. Moreover, $\textbf{MA-OSMA}$ leverages a novel surrogate gradient to avoid sub-optimal stationary points. To eliminate the computationally intensive projection operations in $\textbf{MA-OSMA}$, we also introduce a projection-free $\textbf{MA-OSEA}$ algorithm, which effectively utilizes the KL divergence by mixing a uniform distribution. Theoretically, we confirm that both algorithms achieve a regret bound of $\widetilde{O}(\sqrt{\frac{C_{T}T}{1-\beta}})$ against a $(\frac{1-e^{-c}}{c})$-approximation to the best comparator in hindsight, where $C_{T}$ is the deviation of maximizer sequence, $\beta$ is the spectral gap of the network and $c$ is the joint curvature of submodular objectives. This result significantly improves the $(\frac{1}{1+c})$-approximation provided by the state-of-the-art OSG algorithm. Finally, we demonstrate the effectiveness of our proposed algorithms through simulation-based multi-target tracking., Comment: Accepted to ICLR 2025

Due to the lack of a net magnetic moment, antiferromagnets possess a unique robustness to external magnetic fields and are thus predicted to play an important role in future magnetic technologies. However, this robustness also makes them quite difficult to control, and the development of novel methods to manipulate these systems with external stimuli is a fundamental goal of antiferromagnetic spintronics. In this work, we report evidence for a metastable reorientation of the order parameter in an antiferromagnetic semiconductor triggered by an ultrafast quench of the equilibrium order via photoexcitation above the band gap. The metastable state forms less than 10 ps after the excitation pulse, and persists for longer than 150 ps before decaying to the ground state via thermal fluctuations. Importantly, this transition cannot be induced thermodynamically, and requires the system to be driven out of equilibrium. Broadly speaking, this phenomenology is ultimately the result of large magnetoelastic coupling in combination with a relatively low symmetry of the magnetic ground state. Since neither of these properties are particularly uncommon in magnetic materials, the observations presented here imply a generic path toward novel device technology enabled by ultrafast dynamics in antiferromagnets., Comment: 41 pages, 27 figures

3D Gaussian Splatting (3DGS) has shown remarkable performance in novel view synthesis. However, its rendering quality deteriorates with sparse inphut views, leading to distorted content and reduced details. This limitation hinders its practical application. To address this issue, we propose a sparse-view 3DGS method. Given the inherently ill-posed nature of sparse-view rendering, incorporating prior information is crucial. We propose a semantic regularization technique, using features extracted from the pretrained DINO-ViT model, to ensure multi-view semantic consistency. Additionally, we propose local depth regularization, which constrains depth values to improve generalization on unseen views. Our method outperforms state-of-the-art novel view synthesis approaches, achieving up to 0.4dB improvement in terms of PSNR on the LLFF dataset, with reduced distortion and enhanced visual quality., Comment: 5 pages, 5 figures, has been accepted by the ICASSP 2025

A Markov model is a widely used tool for modeling sequences of events from a finite state-space and hence can be employed to identify the transition probabilities across treatments based on treatment sequence data. To understand how patient-level covariates impact these treatment transitions, the transition probabilities are modeled as a function of patient covariates. This approach enables the visualization of the effect of patient-level covariates on the treatment transitions across patient visits. The proposed method automatically estimates the entries of the transition matrix with smaller numbers of empirical transitions as constant; the user can set desired cutoff of the number of empirical transition counts required for a particular transition probability to be estimated as a function of covariates. Firstly, this strategy automatically enforces the final estimated transition matrix to contain zeros at the locations corresponding to zero empirical transition counts, avoiding further complicated model constructs to handle sparsity, in an efficient manner. Secondly, it restricts estimation of transition probabilities as a function of covariates, when the number of empirical transitions is particularly small, thus avoiding the identifiability issue which might arise due to the p>n scenario when estimating each transition probability as a function of patient covariates. To optimize the multi-modal likelihood, a parallelized scalable global optimization routine is also developed. The proposed method is applied to understand how the transitions across disease modifying therapies (DMTs) in Multiple Sclerosis (MS) patients are influenced by patient-level demographic and clinical phenotypes.

The stylization of 3D scenes is an increasingly attractive topic in 3D vision. Although image style transfer has been extensively researched with promising results, directly applying 2D style transfer methods to 3D scenes often fails to preserve the structural and multi-view properties of 3D environments, resulting in unpleasant distortions in images from different viewpoints. To address these issues, we leverage the remarkable generative prior of diffusion-based models and propose a novel style transfer method, OSDiffST, based on a pre-trained one-step diffusion model (i.e., SD-Turbo) for rendering diverse styles in multi-view images of 3D scenes. To efficiently adapt the pre-trained model for multi-view style transfer on small datasets, we introduce a vision condition module to extract style information from the reference style image to serve as conditional input for the diffusion model and employ LoRA in diffusion model for adaptation. Additionally, we consider color distribution alignment and structural similarity between the stylized and content images using two specific loss functions. As a result, our method effectively preserves the structural information and multi-view consistency in stylized images without any 3D information. Experiments show that our method surpasses other promising style transfer methods in synthesizing various styles for multi-view images of 3D scenes. Stylized images from different viewpoints generated by our method achieve superior visual quality, with better structural integrity and less distortion. The source code is available at https://github.com/YushenZuo/OSDiffST., Comment: Accepted by ECCV 2024 AI for Visual Arts Workshop and Challenges, 18 pages, 7 figures

Atrial fibrillation (AF) is characterized by irregular electrical impulses originating in the atria, which can lead to severe complications and even death. Due to the intermittent nature of the AF, early and timely monitoring of AF is critical for patients to prevent further exacerbation of the condition. Although ambulatory ECG Holter monitors provide accurate monitoring, the high cost of these devices hinders their wider adoption. Current mobile-based AF detection systems offer a portable solution, however, these systems have various applicability issues such as being easily affected by environmental factors and requiring significant user effort. To overcome the above limitations, we present MobileAF, a novel smartphone-based AF detection system using speakers and microphones. In order to capture minute cardiac activities, we propose a multi-channel pulse wave probing method. In addition, we enhance the signal quality by introducing a three-stage pulse wave purification pipeline. What's more, a ResNet-based network model is built to implement accurate and reliable AF detection. We collect data from 23 participants utilizing our data collection application on the smartphone. Extensive experimental results demonstrate the superior performance of our system, with 97.9% accuracy, 96.8% precision, 97.2% recall, 98.3% specificity, and 97.0% F1 score., Comment: This paper has been submitted to ACM Transactions on Sensor Networks (TOSN)

Embeddings as a Service (EaaS) is emerging as a crucial role in AI applications. Unfortunately, EaaS is vulnerable to model extraction attacks, highlighting the urgent need for copyright protection. Although some preliminary works propose applying embedding watermarks to protect EaaS, recent research reveals that these watermarks can be easily removed. Hence, it is crucial to inject robust watermarks resistant to watermark removal attacks. Existing watermarking methods typically inject a target embedding into embeddings through linear interpolation when the text contains triggers. However, this mechanism results in each watermarked embedding having the same component, which makes the watermark easy to identify and eliminate. Motivated by this, in this paper, we propose a novel embedding-specific watermarking (ESpeW) mechanism to offer robust copyright protection for EaaS. Our approach involves injecting unique, yet readily identifiable watermarks into each embedding. Watermarks inserted by ESpeW are designed to maintain a significant distance from one another and to avoid sharing common components, thus making it significantly more challenging to remove the watermarks. Extensive experiments on four popular datasets demonstrate that ESpeW can even watermark successfully against a highly aggressive removal strategy without sacrificing the quality of embeddings. Code is available at https://github.com/liudan193/ESpeW.

This paper reviews the challenge on Sparse Neural Rendering that was part of the Advances in Image Manipulation (AIM) workshop, held in conjunction with ECCV 2024. This manuscript focuses on the competition set-up, the proposed methods and their respective results. The challenge aims at producing novel camera view synthesis of diverse scenes from sparse image observations. It is composed of two tracks, with differing levels of sparsity; 3 views in Track 1 (very sparse) and 9 views in Track 2 (sparse). Participants are asked to optimise objective fidelity to the ground-truth images as measured via the Peak Signal-to-Noise Ratio (PSNR) metric. For both tracks, we use the newly introduced Sparse Rendering (SpaRe) dataset and the popular DTU MVS dataset. In this challenge, 5 teams submitted final results to Track 1 and 4 teams submitted final results to Track 2. The submitted models are varied and push the boundaries of the current state-of-the-art in sparse neural rendering. A detailed description of all models developed in the challenge is provided in this paper., Comment: Part of Advances in Image Manipulation workshop at ECCV 2024

Atrial fibrillation (AF) is characterized by irregular electrical impulses originating in the atria, which can lead to severe complications and even death. Due to the intermittent nature of the AF, early and timely monitoring of AF is critical for patients to prevent further exacerbation of the condition. Although ambulatory ECG Holter monitors provide accurate monitoring, the high cost of these devices hinders their wider adoption. Current mobile-based AF detection systems offer a portable solution. However, these systems have various applicability issues, such as being easily affected by environmental factors and requiring significant user effort. To overcome the above limitations, we present AcousAF, a novel AF detection system based on acoustic sensors of smartphones. Particularly, we explore the potential of pulse wave acquisition from the wrist using smartphone speakers and microphones. In addition, we propose a well-designed framework comprised of pulse wave probing, pulse wave extraction, and AF detection to ensure accurate and reliable AF detection. We collect data from 20 participants utilizing our custom data collection application on the smartphone. Extensive experimental results demonstrate the high performance of our system, with 92.8% accuracy, 86.9% precision, 87.4% recall, and 87.1% F1 Score., Comment: Accepted for publication in Companion of the 2024 ACM International Joint Conference on Pervasive and Ubiquitous Computing (UbiComp Companion '24)

Due to the successful development of deep image generation technology, forgery detection plays a more important role in social and economic security. Racial bias has not been explored thoroughly in the deep forgery detection field. In the paper, we first contribute a dedicated dataset called the Fair Forgery Detection (FairFD) dataset, where we prove the racial bias of public state-of-the-art (SOTA) methods. Different from existing forgery detection datasets, the self-constructed FairFD dataset contains a balanced racial ratio and diverse forgery generation images with the largest-scale subjects. Additionally, we identify the problems with naive fairness metrics when benchmarking forgery detection models. To comprehensively evaluate fairness, we design novel metrics including Approach Averaged Metric and Utility Regularized Metric, which can avoid deceptive results. We also present an effective and robust post-processing technique, Bias Pruning with Fair Activations (BPFA), which improves fairness without requiring retraining or weight updates. Extensive experiments conducted with 12 representative forgery detection models demonstrate the value of the proposed dataset and the reasonability of the designed fairness metrics. By applying the BPFA to the existing fairest detector, we achieve a new SOTA. Furthermore, we conduct more in-depth analyses to offer more insights to inspire researchers in the community.

Symmetric submodular maximization is an important class of combinatorial optimization problems, including MAX-CUT on graphs and hyper-graphs. The state-of-the-art algorithm for the problem over general constraints has an approximation ratio of $0.432$. The algorithm applies the canonical continuous greedy technique that involves a sampling process. It, therefore, suffers from high query complexity and is inherently randomized. In this paper, we present several efficient deterministic algorithms for maximizing a symmetric submodular function under various constraints. Specifically, for the cardinality constraint, we design a deterministic algorithm that attains a $0.432$ ratio and uses $O(kn)$ queries. Previously, the best deterministic algorithm attains a $0.385-\epsilon$ ratio and uses $O\left(kn (\frac{10}{9\epsilon})^{\frac{20}{9\epsilon}-1}\right)$ queries. For the matroid constraint, we design a deterministic algorithm that attains a $1/3-\epsilon$ ratio and uses $O(kn\log \epsilon^{-1})$ queries. Previously, the best deterministic algorithm can also attain $1/3-\epsilon$ ratio but it uses much larger $O(\epsilon^{-1}n^4)$ queries. For the packing constraints with a large width, we design a deterministic algorithm that attains a $0.432-\epsilon$ ratio and uses $O(n^2)$ queries. To the best of our knowledge, there is no deterministic algorithm for the constraint previously. The last algorithm can be adapted to attain a $0.432$ ratio for single knapsack constraint using $O(n^4)$ queries. Previously, the best deterministic algorithm attains a $0.316-\epsilon$ ratio and uses $\widetilde{O}(n^3)$ queries.

We propose a novel pulsed optical field method that alternately switches the pump beam in conventional saturation absorption to time-division multiplex the same probe beam into both probe and reference beams, followed by digital differential processing to achieve deterministic zero-background Doppler-free spectroscopy. This method effectively mitigates Doppler broadening and common-mode optical noise by addressing disturbances such as non-uniform background absorption and environmental noise, thereby offering enhanced accuracy and robustness. Using this technique, we measured the absolute frequency of Yb$^{+}$ isotopes in the $6s^2\ ^{1}S_0\to 6s6p ^{1}P_1$ transition. By employing an error signal derived from the first-derivative demodulated spectrum of $^{174}\mathrm{Yb}^{+}$, we achieved efficient stabilization of a 369.5 nm ultraviolet diode laser, demonstrating a frequency stability of $3 \times 10^{-11}$ over a 1500-second averaging period and a locking point uncertainty of 850 kHz sustained over 10 days. Furthermore, we report the first in-situ observation of Doppler-free Zeeman sub-level spectra, highlighting the precision of this method and its potential application in measuring magnetic field gradients., Comment: 6 pages, 6 figures

Projected Gradient Ascent (PGA) is the most commonly used optimization scheme in machine learning and operations research areas. Nevertheless, numerous studies and examples have shown that the PGA methods may fail to achieve the tight approximation ratio for continuous DR-submodular maximization problems. To address this challenge, we present a boosting technique in this paper, which can efficiently improve the approximation guarantee of the standard PGA to \emph{optimal} with only small modifications on the objective function. The fundamental idea of our boosting technique is to exploit non-oblivious search to derive a novel auxiliary function $F$, whose stationary points are excellent approximations to the global maximum of the original DR-submodular objective $f$. Specifically, when $f$ is monotone and $\gamma$-weakly DR-submodular, we propose an auxiliary function $F$ whose stationary points can provide a better $(1-e^{-\gamma})$-approximation than the $(\gamma^2/(1+\gamma^2))$-approximation guaranteed by the stationary points of $f$ itself. Similarly, for the non-monotone case, we devise another auxiliary function $F$ whose stationary points can achieve an optimal $\frac{1-\min_{\boldsymbol{x}\in\mathcal{C}}\|\boldsymbol{x}\|_{\infty}}{4}$-approximation guarantee where $\mathcal{C}$ is a convex constraint set. In contrast, the stationary points of the original non-monotone DR-submodular function can be arbitrarily bad~\citep{chen2023continuous}. Furthermore, we demonstrate the scalability of our boosting technique on four problems. In all of these four problems, our resulting variants of boosting PGA algorithm beat the previous standard PGA in several aspects such as approximation ratio and efficiency. Finally, we corroborate our theoretical findings with numerical experiments, which demonstrate the effectiveness of our boosting PGA methods., Comment: 74 pages, 6 figures and 9 tables. An extended version of Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function (ICML 2022)

The competitive auction was first proposed by Goldberg, Hartline, and Wright. In their paper, they introduce the competitive analysis framework of online algorithm designing into the traditional revenue-maximizing auction design problem. While the competitive analysis framework only cares about the worst-case bound, a growing body of work in the online algorithm community studies the learning-augmented framework. In this framework, designers are allowed to leverage imperfect machine-learned predictions of unknown information and pursue better theoretical guarantees when the prediction is accurate(consistency). Meanwhile, designers also need to maintain a nearly-optimal worst-case ratio(robustness). In this work, we revisit the competitive auctions in the learning-augmented setting. We leverage the imperfect predictions of the private value of the bidders and design the learning-augmented mechanisms for several competitive auctions with different constraints, including digital good auctions, limited-supply auctions, and general downward-closed permutation environments. For all these auction environments, our mechanisms enjoy $1$-consistency against the strongest benchmark $OPT$, which is impossible to achieve $O(1)$-competitive without predictions. At the same time, our mechanisms also maintain the $O(1)$-robustness against all benchmarks considered in the traditional competitive analysis. Considering the possible inaccuracy of the predictions, we provide a reduction that transforms our learning-augmented mechanisms into an error-tolerant version, which enables the learning-augmented mechanism to ensure satisfactory revenue in scenarios where the prediction error is moderate., Comment: Accepted by EC 2024. Improved the error-tolerant results

The structural symmetry of solids plays an important role in defining their linear and nonlinear optical properties. The quest for versatile, cost-effective, large-scale, and defect-free approaches and materials platforms for tailoring structural and optical properties on demand has been underway for decades. We experimentally demonstrate a bottom-up self-assembly-based organic engineered material comprised of synthesized molecules with large dipole moments that are crystallized into a spherulite structure. The molecules align in an azimuthal direction, resulting in a vortex polarity with spontaneously broken symmetry leading to strong optical anisotropy and nonlinear optical responses. These unique polarization properties of the judiciously designed organic spherulite combined with the symmetry of structured optical beams enable a plethora of new linear and nonlinear light-matter interactions, including the generation of optical vortex beams with complex spin states and on-demand topological charges at the fundamental, doubled, and tripled frequencies. The results of this work are likely to enable numerous applications in areas such as high-dimensional quantum information processing, with large capacity and high security. The demonstrated spherulite crystals facilitate stand-alone micro-scale devices that rely on the unique micro-scale spontaneous vortex polarity that is likely to enable future applications for high-dimensional quantum information processing, spatiotemporal optical vortices, and a novel platform for optical manipulation and trapping.

We investigate the online bandit learning of the monotone multi-linear DR-submodular functions, designing the algorithm $\mathtt{BanditMLSM}$ that attains $O(T^{2/3}\log T)$ of $(1-1/e)$-regret. Then we reduce submodular bandit with partition matroid constraint and bandit sequential monotone maximization to the online bandit learning of the monotone multi-linear DR-submodular functions, attaining $O(T^{2/3}\log T)$ of $(1-1/e)$-regret in both problems, which improve the existing results. To the best of our knowledge, we are the first to give a sublinear regret algorithm for the submodular bandit with partition matroid constraint. A special case of this problem is studied by Streeter et al.(2009). They prove a $O(T^{4/5})$ $(1-1/e)$-regret upper bound. For the bandit sequential submodular maximization, the existing work proves an $O(T^{2/3})$ regret with a suboptimal $1/2$ approximation ratio (Niazadeh et al. 2021)., Comment: Accepted by ICML 2023

High-precision inertial sensors or accelerometers can provide us references of free-falling motions in gravitational field in space. They serve as the key payloads for gravity recovery missions such as the CHAMP, the GRACE-type missions, and the planned Next Generation Gravity Missions. In this work, a systematic method of electrostatic inertial sensor calibrations for gravity recovery satellites is suggested, which is applied to and verified with the Taiji-1 mission. With this method, the complete operating parameters including the scale factors, the center of mass offset vector and the intrinsic biased acceleration can be precisely calibrated with only two sets of short-term in-orbit experiments. Taiji-1 is the first technology demonstration satellite of the "Taiji Program in Space", which, in its final extended phase in 2022, could be viewed as operating in the mode of a high-low satellite-to-satellite tracking gravity mission. Based on the calibration principles, swing maneuvers with time span about 200 s and rolling maneuvers for 19 days were conducted by Taiji-1 in 2022. The inertial sensor's operating parameters are precisely re-calibrated with Kalman filters and are updated to the Taiji-1 science team. Data from one of the sensitive axis is re-processed with the updated operating parameters, and the performance is found to be slightly improved compared with former results. This approach could be of high reference value for the accelerometer or inertial sensor calibrations of the GFO, the Chinese GRACE-type mission, and the Next Generation Gravity Missions. This could also shed some light on the in-orbit calibrations of the ultra-precision inertial sensors for future GW space antennas because of the technological inheritance between these two generations of inertial sensors., Comment: 24 pages, 19 figures

The spontaneous formation of electronic orders is a crucial element for understanding complex quantum states and engineering heterostructures in two-dimensional materials. We report a novel $\sqrt{19}\times\sqrt{19}$ charge order in few-layer thick 1T-TaTe$_2$ transition metal dichalcogenide films grown by molecular beam epitaxy, which has not been realized. Our photoemission and scanning probe measurements demonstrate that monolayer 1T-TaTe$_2$ exhibits a variety of metastable charge density wave orders, including the $\sqrt{19}\times\sqrt{19}$ superstructure, which can be selectively stabilized by controlling the post-growth annealing temperature. Moreover, we find that only the $\sqrt{19}\times\sqrt{19}$ order persists in 1T-TaTe$_2$ films thicker than a monolayer, up to 8 layers. Our findings identify the previously unrealized novel electronic order in a much-studied transition metal dichalcogenide and provide a viable route to control it within the epitaxial growth process.