Search arXiv⌕ Search

arXiv subjects

Teng Zhang

Publications and source records attributed to Teng Zhang.

At least 145 records · Page 8Linked to original sources

FedBone: Towards Large-Scale Federated Multi-Task Learning

Heterogeneous federated multi-task learning (HFMTL) is a federated learning technique that combines heterogeneous tasks of different clients to achieve more accurate, comprehensive predictions. In real-world applications, visual and natural language tasks typically require large-scale models to extract high-level abstract features. However, large-scale models cannot be directly applied to existing federated multi-task learning methods. Existing HFML methods also disregard the impact of gradient conflicts on multi-task optimization during the federated aggregation process. In this work, we propose an innovative framework called FedBone, which enables the construction of large-scale models with better generalization from the perspective of server-client split learning and gradient projection. We split the entire model into two components: a large-scale general model (referred to as the general model) on the cloud server and multiple task-specific models (referred to as the client model) on edge clients, solving the problem of insufficient computing power on edge clients. The conflicting gradient projection technique is used to enhance the generalization of the large-scale general model between different tasks. The proposed framework is evaluated on two benchmark datasets and a real ophthalmic dataset. Comprehensive results demonstrate that FedBone efficiently adapts to heterogeneous local tasks of each client and outperforms existing federated learning algorithms in most dense prediction and classification tasks with off-the-shelf computational resources on the client side.

cs.LG↗

Science with the Einstein Telescope: a comparison of different designs

The Einstein Telescope (ET), the European project for a third-generation gravitational-wave detector, has a reference configuration based on a triangular shape consisting of three nested detectors with 10 km arms, where in each arm there is a `xylophone' configuration made of an interferometer tuned toward high frequencies, and an interferometer tuned toward low frequencies and working at cryogenic temperature. Here, we examine the scientific perspectives under possible variations of this reference design. We perform a detailed evaluation of the science case for a single triangular geometry observatory, and we compare it with the results obtained for a network of two L-shaped detectors (either parallel or misaligned) located in Europe, considering different choices of arm-length for both the triangle and the 2L geometries. We also study how the science output changes in the absence of the low-frequency instrument, both for the triangle and the 2L configurations. We examine a broad class of simple `metrics' that quantify the science output, related to compact binary coalescences, multi-messenger astronomy and stochastic backgrounds, and we then examine the impact of different detector designs on a more specific set of scientific objectives.

gr-qc↗

Scalable Optimal Margin Distribution Machine

Optimal margin Distribution Machine (ODM) is a newly proposed statistical learning framework rooting in the novel margin theory, which demonstrates better generalization performance than the traditional large margin based counterparts. Nonetheless, it suffers from the ubiquitous scalability problem regarding both computation time and memory as other kernel methods. This paper proposes a scalable ODM, which can achieve nearly ten times speedup compared to the original ODM training method. For nonlinear kernels, we propose a novel distribution-aware partition method to make the local ODM trained on each partition be close and converge fast to the global one. When linear kernel is applied, we extend a communication efficient SVRG method to accelerate the training further. Extensive empirical studies validate that our proposed method is highly computational efficient and almost never worsen the generalization.

cs.LG↗

Theoretical Guarantees for Sparse Principal Component Analysis based on the Elastic Net

Sparse principal component analysis (SPCA) is widely used for dimensionality reduction and feature extraction in high-dimensional data analysis. Despite many methodological and theoretical developments in the past two decades, the theoretical guarantees of the popular SPCA algorithm proposed by Zou, Hastie & Tibshirani (2006) are still unknown. This paper aims to address this critical gap. We first revisit the SPCA algorithm of Zou et al. (2006) and present our implementation. We also study a computationally more efficient variant of the SPCA algorithm in Zou et al. (2006) that can be considered as the limiting case of SPCA. We provide the guarantees of convergence to a stationary point for both algorithms and prove that, under a sparse spiked covariance model, both algorithms can recover the principal subspace consistently under mild regularity conditions. We show that their estimation error bounds match the best available bounds of existing works or the minimax rates up to some logarithmic factors. Moreover, we demonstrate the competitive numerical performance of both algorithms in numerical studies.

math.ST↗

Understanding Overfitting in Adversarial Training via Kernel Regression

Adversarial training and data augmentation with noise are widely adopted techniques to enhance the performance of neural networks. This paper investigates adversarial training and data augmentation with noise in the context of regularized regression in a reproducing kernel Hilbert space (RKHS). We establish the limiting formula for these techniques as the attack and noise size, as well as the regularization parameter, tend to zero. Based on this limiting formula, we analyze specific scenarios and demonstrate that, without appropriate regularization, these two methods may have larger generalization error and Lipschitz constant than standard kernel regression. However, by selecting the appropriate regularization parameter, these two methods can outperform standard kernel regression and achieve smaller generalization error and Lipschitz constant. These findings support the empirical observations that adversarial training can lead to overfitting, and appropriate regularization methods, such as early stopping, can alleviate this issue.

stat.ML↗

A Gravitational Wave Detector for Post Merger Neutron Stars: Beyond the Quantum Loss Limit of Michelson Fabry Perot Interferometer

Advanced gravitational-wave detectors that have made groundbreaking discoveries are Michelson interferometers with resonating optical cavities as their arms. As light travels at finite speed, these cavities are optimal for enhancing signals at frequencies below their bandwidth frequency. A small amount of optical loss will, however, significantly impact the high-frequency signals which are not optimally amplified. We find an elegant interferometer configuration with an "L-resonator" as the core, significantly surpassing the loss limited sensitivity of dual recycled Fabry Perot Michelson interferometers at high frequencies. Following this concept, we provide a broadband design of a 25 km detector with outstanding sensitivity between 2-4 kHz. We have performed Monte-Carlo population studies of binary neutron star mergers, given the most recent merger rate from the GWTC-3 catalog and several representative neutron star equations of state. We find that the new interferometer configuration significantly outperforms other third-generation detectors by a factor of 3 to 7 in the signal-to-noise ratio of the post-merger signal. Assuming a detection threshold with signal-to-noise ratio >5 and for the cases we have explored, the new design is the only detector that confidently achieves a detection rate larger than one per year, with the rate being 1 to 30 events per year.

gr-qc↗

Mobility exceeding 100,000 cm$^2$/Vs in modulation-doped shallow InAs quantum wells coupled to epitaxial aluminum

The two-dimensional electron gas residing in shallow InAs quantum wells coupled to epitaxial aluminum is a widely utilized platform for exploration of topological superconductivity. Strong spin-orbit coupling, large effective $g$-factor, and control over proximity-induced superconductivity are important attributes. Disorder in shallow semiconductor structures plays a crucial role for the stability of putative topological phases in hybrid structures. We report on the transport properties of 2DEGs residing 10nm below the surface in shallow InAs quantum wells in which mobility may exceed 100,000 cm$^2$/Vs at 2DEG density n$_{2DEG}$$\leq$1$\times$10$^{12}$cm$^{-2}$ at low temperature.

cond-mat.mes-hall↗

On the Optimization of Margin Distribution

Margin has played an important role on the design and analysis of learning algorithms during the past years, mostly working with the maximization of the minimum margin. Recent years have witnessed the increasing empirical studies on the optimization of margin distribution according to different statistics such as medium margin, average margin, margin variance, etc., whereas there is a relative paucity of theoretical understanding. In this work, we take one step on this direction by providing a new generalization error bound, which is heavily relevant to margin distribution by incorporating ingredients such as average margin and semi-variance, a new margin statistics for the characterization of margin distribution. Inspired by the theoretical findings, we propose the MSVMAv, an efficient approach to achieve better performance by optimizing margin distribution in terms of its empirical average margin and semi-variance. We finally conduct extensive experiments to show the superiority of the proposed MSVMAv approach.

cs.LG↗

Robust Regularized Low-Rank Matrix Models for Regression and Classification

While matrix variate regression models have been studied in many existing works, classical statistical and computational methods for the analysis of the regression coefficient estimation are highly affected by high dimensional and noisy matrix-valued predictors. To address these issues, this paper proposes a framework of matrix variate regression models based on a rank constraint, vector regularization (e.g., sparsity), and a general loss function with three special cases considered: ordinary matrix regression, robust matrix regression, and matrix logistic regression. We also propose an alternating projected gradient descent algorithm. Based on analyzing our objective functions on manifolds with bounded curvature, we show that the algorithm is guaranteed to converge, all accumulation points of the iterates have estimation errors in the order of $O(1/\sqrt{n})$ asymptotically and substantially attaining the minimax rate. Our theoretical analysis can be applied to general optimization problems on manifolds with bounded curvature and can be considered an important technical contribution to this work. We validate the proposed method through simulation studies and real image data examples.

stat.ML↗

Layer-by-layer growth of bilayer graphene single-crystals enabled by self-transmitting catalytic activity

Direct growth of large-area vertically stacked two-dimensional (2D) van der Waal (vdW) materials is a prerequisite for their high-end applications in integrated electronics, optoelectronics and photovoltaics. Currently, centimetre- to even metre-scale monolayers of single-crystal graphene (MLG) and hexagonal boron nitride (h-BN) have been achieved by epitaxial growth on various single-crystalline substrates. However, in principle, this success in monolayer epitaxy seems extremely difficult to be replicated to bi- or few-layer growth, as the full coverage of the first layer was believed to terminate the reactivity of those adopting catalytic metal surfaces. Here, we report an exceptional layer-by-layer chemical vapour deposition (CVD) growth of large size bi-layer graphene single-crystals, enabled by self-transmitting catalytic activity from platinum (Pt) surfaces to the outermost graphene layers. In-situ growth and real-time surveillance experiments, under well-controlled environments, unambiguously verify that the growth does follow the layer-by-layer mode on open surfaces of MLG/Pt(111). First-principles calculations indicate that the transmittal of catalytic activity is allowed by an appreciable electronic hybridisation between graphene overlayers and Pt surfaces, enabling catalytic dissociation of hydrocarbons and subsequently direct graphitisation of their radicals on the outermost sp2 carbon surface. This self-transmitting catalytic activity is also proven to be robust for tube-furnace CVD in fabricating single-crystalline graphene bi-, tri- and tetra-layers, as well as h-BN few-layers. Our findings offer an exceptional strategy for potential controllable, layer-by-layer and wafer-scale growth of vertically stacked few-layered 2D single crystals.

cond-mat.mtrl-sci↗

3D Morphology of Open Clusters in the Solar Neighborhood with Gaia EDR3 II: Hierarchical Star Formation Revealed by Spatial and Kinematic Substructures

We identify members of 65 open clusters in the solar neighborhood using the machine-learning algorithm StarGO based on Gaia EDR3 data. After adding members of twenty clusters from previous studies (Pang et al. 2021a,b; Li et al. 2021) we obtain 85 clusters, and study their morphology and kinematics. We classify the substructures outside the tidal radius into four categories: filamentary (f1) and fractal (f2) for clusters $<100$ Myr, and halo (h) and tidal-tail (t) for clusters $>100$ Myr. The kinematical substructures of f1-type clusters are elongated; these resemble the disrupted cluster Group X. Kinematic tails are distinct in t-type clusters, especially Pleiades. We identify 29 hierarchical groups in four young regions (Alessi 20, IC 348, LP 2373, LP 2442); ten among these are new. The hierarchical groups form filament networks. Two regions (Alessi 20, LP 2373) exhibit global "orthogonal" expansion (stellar motion perpendicular to the filament), which might cause complete dispersal. Infalling-like flows (stellar motion along the filament) are found in UBC 31 and related hierarchical groups in the IC 348 region. Stellar groups in the LP 2442 region (LP 2442 gp 1-5) are spatially well-mixed but kinematically coherent. A merging process might be ongoing in the LP 2442 subgroups. For younger systems ($\lesssim30$ Myr), the mean axis ratio, cluster mass and half-mass radius tend to increase with age values. These correlations between structural parameters may imply two dynamical processes occurring in the hierarchical formation scenario in young stellar groups: (1) filament dissolution and (2) sub-group mergers.

astro-ph.GA↗

Element-wise Estimation Error of Generalized Fused Lasso

The main result of this article is that we obtain an elementwise error bound for the Fused Lasso estimator for any general convex loss function $ρ$. We then focus on the special cases when either $ρ$ is the square loss function (for mean regression) or is the quantile loss function (for quantile regression) for which we derive new pointwise error bounds. Even though error bounds for the usual Fused Lasso estimator and its quantile version have been studied before; our bound appears to be new. This is because all previous works bound a global loss function like the sum of squared error, or a sum of Huber losses in the case of quantile regression in Padilla and Chatterjee (2021). Clearly, element wise bounds are stronger than global loss error bounds as it reveals how the loss behaves locally at each point. Our element wise error bound also has a clean and explicit dependence on the tuning parameter $λ$ which informs the user of a good choice of $λ$. In addition, our bound is nonasymptotic with explicit constants and is able to recover almost all the known results for Fused Lasso (both mean and quantile regression) with additional improvements in some cases.

math.ST↗

Atomic-Scale Visualization of Chiral Charge Density Wave States and Their Reversible Transition

Chirality is essential for various amazing phenomena in life and matter. However,chirality and its switching in electronic superlattices, such as charge density wave(CDW) arrays, remain elusive. In this study, we characterize the chirality transition with atom-resolution imaging in a single-layer NbSe2 CDW pattern by technique of scanning tunneling microscopy. The atomic lattice of the CDW array is found continuous and intact although its chirality is switched. Several intermediate states are tracked by time-resolved imaging, revealing the fast and dynamic chirality transition. Importantly, the switching is reversibly realized with an external electric-field. Our findings unveil the delicate transition process of chiral CDW array in a 2D crystal down to the atomic scale and may be applicable for future nanoscale devices.

cond-mat.mtrl-sci↗

The Design and Implementation of a Broadly Applicable Algorithm for Optimizing Intra-Day Surgical Scheduling

Surgical scheduling optimization is an active area of research. However, few algorithms to optimize surgical scheduling are implemented and see sustained use. An algorithm is more likely to be implemented, if it allows for surgeon autonomy, i.e., requires only limited scheduling centralization, and functions in the limited technical infrastructure of widely used electronic medical records (EMRs). In order for an algorithm to see sustained use, it must be compatible with changes to hospital capacity, patient volumes, and scheduling practices. To meet these objectives, we developed the BEDS (better elective day of surgery) algorithm, a greedy heuristic for smoothing unit-specific surgical admissions across days. We implemented BEDS in the EMR of a large pediatric academic medical center. The use of BEDS was associated with a reduction in the variability in the number of admissions. BEDS is freely available as a dashboard in Tableau, a commercial software used by numerous hospitals. BEDS is readily implementable with the limited tools available to most hospitals, does not require reductions to surgeon autonomy or centralized scheduling, and is compatible with changes to hospital capacity or patient volumes. We present a general algorithmic framework from which BEDS is derived based on a particular choice of objectives and constraints. We argue that algorithms generated by this framework retain many of the desirable characteristics of BEDS while being compatible with a wide range of objectives and constraints.

cs.AI↗

A six degree-of-freedom fused silica seismometer: Design and tests of a metal prototype

Ground vibrations couple to the longitudinal and angular motion of the aLIGO test masses and limit the observatory sensitivity below 30\,Hz. Novel inertial sensors have the potential to improve the aLIGO sensitivity in this band and simplify the lock acquisition of the detectors. In this paper, we experimentally study a compact 6D seismometer that consists of a mass suspended by a single wire. The position of the mass is interferometrically read out relative to the platform that supports the seismometer. We present the experimental results, discuss limitations of our metallic prototype, and show that a compact 6D seismometer made out of fused silica and suspended with a fused silica fibre has the potential to improve the aLIGO low frequency noise.

physics.ins-det↗

Study of acceleration measurement in gravitational wave detection

Position-meter and speed-meter interferometers have been analysed for detecting gravitational waves. We introduce the concept of acceleration measurement in comparison with position and speed measurement. In this paper, we describe a general acceleration measurement and derive its standard quantum limit. We provide an example of an acceleration-meter interferometer configuration. We show that shot noise dominates at low frequency following a frequency dependence of $1/Ω^2$, while radiation pressure noise is constant. The acceleration-meter has even a stronger radiation pressure noise suppression than speed-meter.

gr-qc↗

ALMA: Alternating Minimization Algorithm for Clustering Mixture Multilayer Network

The paper considers a Mixture Multilayer Stochastic Block Model (MMLSBM), where layers can be partitioned into groups of similar networks, and networks in each group are equipped with a distinct Stochastic Block Model. The goal is to partition the multilayer network into clusters of similar layers, and to identify communities in those layers. Jing et al. (2020) introduced the MMLSBM and developed a clustering methodology, TWIST, based on regularized tensor decomposition. The present paper proposes a different technique, an alternating minimization algorithm (ALMA), that aims at simultaneous recovery of the layer partition, together with estimation of the matrices of connection probabilities of the distinct layers. Compared to TWIST, ALMA achieves higher accuracy both theoretically and numerically.

stat.ML↗

Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions

This paper studies an optimization problem on the sum of traces of matrix quadratic forms in $m$ semi-orthogonal matrices, which can be considered as a generalization of the synchronization of rotations. While the problem is nonconvex, the paper shows that its semidefinite programming relaxation solves the original nonconvex problems exactly with high probability, under an additive noise model with small noise in the order of $O(m^{1/4})$. In addition, it shows that the solution of a nonconvex algorithm considered in Won, Zhou, and Lange [SIAM J. Matrix Anal. Appl., 2 (2021), pp. 859-882] is also its global solution with high probability under similar conditions. These results can be considered as a generalization of existing results on phase synchronization.

math.OC↗