arXiv subjects

Cheng Zhang

Publications and source records attributed to Cheng Zhang.

At least 397 records · Page 22Linked to original sources

arXiv2021

Probabilistic DAG Search

Exciting contemporary machine learning problems have recently been phrased in the classic formalism of tree search -- most famously, the game of Go. Interestingly, the state-space underlying these sequential decision-making problems often posses a more general latent structure than can be captured by a tree. In this work, we develop a probabilistic framework to exploit a search space's latent structure and thereby share information across the search tree. The method is based on a combination of approximate inference in jointly Gaussian models for the explored part of the problem, and an abstraction for the unexplored part that imposes a reduction of complexity ad hoc. We empirically find our algorithm to compare favorably to existing non-probabilistic alternatives in Tic-Tac-Toe and a feature selection application.

cs.LG↗

arXiv2021

Causally Constrained Data Synthesis for Private Data Release

Making evidence based decisions requires data. However for real-world applications, the privacy of data is critical. Using synthetic data which reflects certain statistical properties of the original data preserves the privacy of the original data. To this end, prior works utilize differentially private data release mechanisms to provide formal privacy guarantees. However, such mechanisms have unacceptable privacy vs. utility trade-offs. We propose incorporating causal information into the training process to favorably modify the aforementioned trade-off. We theoretically prove that generative models trained with additional causal knowledge provide stronger differential privacy guarantees. Empirically, we evaluate our solution comparing different models based on variational auto-encoders (VAEs), and show that causal information improves resilience to membership inference, with improvements in downstream utility.

cs.LG↗

arXiv2021

Squared eigenfunction symmetry of the D$Δ$mKP hierarchy and its constraint

In this paper squared eigenfunction symmetry of the differential-difference modified Kadomtsev-Petviashvili (D$Δ$mKP) hierarchy and its constraint are considered. Under the constraint, the Lax triplets of the D$Δ$mKP hierarchy, together with their adjoint forms, give rise to the positive relativistic Toda (R-Toda) hierarchy. An invertible transformation is given to connect the positive and negative R-Toda hierarchies. The positive R-Toda hierarchy is reduced to the differential-difference Burgers hierarchy. We also consider another D$Δ$mKP hierarchy and show that its squared eigenfunction symmetry constraint gives rise to the Volterra hierarchy. In addition, we revisit the Ragnisco-Tu hierarchy which is a squared eigenfunction symmetry constraint of the differential-difference Kadomtsev-Petviashvili (D$Δ$KP) system. It was thought the Ragnisco-Tu hierarchy does not exist one-field reduction, but here we find an one-field reduction to reduce the hierarchy to the Volterra hierarchy. Besides, the differential-difference Burgers hierarchy are also investigated in Appendix. A multi-dimensionally consistent 3-point discrete Burgers equation is given.

nlin.SI↗

arXiv2021

Tunable terahertz plasmons in graphite thin films

Tunable terahertz plasmons are essential for reconfigurable photonics, which have been demonstrated in graphene through gating, though with relatively weak responses. Here, we demonstrate strong terahertz plasmons in graphite thin films via infrared spectroscopy, with dramatic tunability by even a moderate temperature change or an in-situ bias voltage. Meanwhile, through magneto-plasmon studies, we reveal that massive electrons and massless Dirac holes make comparable contributions to the plasmon response. Our study not only sets up a platform for further exploration of two-component plasmas, but also opens an avenue for terahertz modulation through electrical bias or all-optical means.

physics.optics↗

arXiv2021

Pressure-enhanced ferromagnetism in layered CrSiTe3 flakes

The research on van der Waals (vdW) layered ferromagnets have promoted the development of nanoscale spintronics and applications. However, low-temperature ferromagnetic properties of these materials greatly hinder their applications. Here, we report pressure-enhanced ferromagnetic behaviours in layered CrSiTe3 flakes revealed by high-pressure magnetic circular dichroism (MCD) measurement. At ambient pressure, CrSiTe3 undergoes a paramagnetic-to-ferromagnetic phase transition at 32.8 K, with a negligible hysteresis loop, indicating a soft ferromagnetic behaviour. Under 4.6 GPa pressure, the soft ferromagnet changes into hard one, signalled by a rectangular hysteretic loop with remnant magnetization at zero field. Interestingly, with further increasing pressure, the coercive field (H_c) dramatically increases from 0.02 T at 4.6 GPa to 0.17 T at 7.8 GPa, and the Curie temperature (T_c^h: the temperature for closing the hysteresis loop) also increases from ~36 K at 4.6 GPa to ~138 K at 7.8 GPa. The influences of pressure on exchange interactions are further investigated by density functional theory calculations, which reveal that the in-plane nearest-neighbor exchange interaction and magneto-crystalline anisotropy increase simultaneously as pressure increases, leading to increased H_c and T_c^h in experiments. The effective interaction between magnetic couplings and external pressure offers new opportunities for both searching room-temperature layered ferromagnets and designing pressure-sensitive magnetic functional devices.

cond-mat.mtrl-sci↗

arXiv2021

Dynamic gesture retrieval: searching videos by human pose sequence

The number of static human poses is limited, it is hard to retrieve the exact videos using one single pose as the clue. However, with a pose sequence or a dynamic gesture as the keyword, retrieving specific videos becomes more feasible. We propose a novel method for querying videos containing a designated sequence of human poses, whereas previous works only designate a single static pose. The proposed method takes continuous 3d human poses from keyword gesture video and video candidates, then converts each pose in individual frames into bone direction descriptors, which describe the direction of each natural connection in articulated pose. A temporal pyramid sliding window is then applied to find matches between designated gesture and video candidates, which ensures that same gestures with different duration can be matched.

cs.CV↗

arXiv2021

A data-driven and model-based accelerated Hamiltonian Monte Carlo method for Bayesian elliptic inverse problems

In this paper, we consider a Bayesian inverse problem modeled by elliptic partial differential equations (PDEs). Specifically, we propose a data-driven and model-based approach to accelerate the Hamiltonian Monte Carlo (HMC) method in solving large-scale Bayesian inverse problems. The key idea is to exploit (model-based) and construct (data-based) the intrinsic approximate low-dimensional structure of the underlying problem which consists of two components - a training component that computes a set of data-driven basis to achieve significant dimension reduction in the solution space, and a fast solving component that computes the solution and its derivatives for a newly sampled elliptic PDE with the constructed data-driven basis. Hence we achieve an effective data and model-based approach for the Bayesian inverse problem and overcome the typical computational bottleneck of HMC - repeated evaluation of the Hamiltonian involving the solution (and its derivatives) modeled by a complex system, a multiscale elliptic PDE in our case. We present numerical examples to demonstrate the accuracy and efficiency of the proposed method.

math.NA↗

arXiv2021

Variational Bayesian Supertrees

Given overlapping subsets of a set of taxa (e.g. species), and posterior distributions on phylogenetic tree topologies for each of these taxon sets, how can we infer a posterior distribution on phylogenetic tree topologies for the entire taxon set? Although the equivalent problem for in the non-Bayesian case has attracted substantial research, the Bayesian case has not attracted the attention it deserves. In this paper we develop a variational Bayes approach to this problem and demonstrate its effectiveness.

q-bio.PE↗

arXiv2021

Instructions and Guide for Diagnostic Questions: The NeurIPS 2020 Education Challenge

Digital technologies are becoming increasingly prevalent in education, enabling personalized, high quality education resources to be accessible by students across the world. Importantly, among these resources are diagnostic questions: the answers that the students give to these questions reveal key information about the specific nature of misconceptions that the students may hold. Analyzing the massive quantities of data stemming from students' interactions with these diagnostic questions can help us more accurately understand the students' learning status and thus allow us to automate learning curriculum recommendations. In this competition, participants will focus on the students' answer records to these multiple-choice diagnostic questions, with the aim of 1) accurately predicting which answers the students provide; 2) accurately predicting which questions have high quality; and 3) determining a personalized sequence of questions for each student that best predicts the student's answers. These tasks closely mimic the goals of a real-world educational platform and are highly representative of the educational challenges faced today. We provide over 20 million examples of students' answers to mathematics questions from Eedi, a leading educational platform which thousands of students interact with daily around the globe. Participants to this competition have a chance to make a lasting, real-world impact on the quality of personalized education for millions of students across the world.

cs.CY↗

arXiv2021

Contextual HyperNetworks for Novel Feature Adaptation

While deep learning has obtained state-of-the-art results in many applications, the adaptation of neural network architectures to incorporate new output features remains a challenge, as neural networks are commonly trained to produce a fixed output dimension. This issue is particularly severe in online learning settings, where new output features, such as items in a recommender system, are added continually with few or no associated observations. As such, methods for adapting neural networks to novel features which are both time and data-efficient are desired. To address this, we propose the Contextual HyperNetwork (CHN), an auxiliary model which generates parameters for extending the base model to a new feature, by utilizing both existing data as well as any observations and/or metadata associated with the new feature. At prediction time, the CHN requires only a single forward pass through a neural network, yielding a significant speed-up when compared to re-training and fine-tuning approaches. To assess the performance of CHNs, we use a CHN to augment a partial variational autoencoder (P-VAE), a deep generative model which can impute the values of missing features in sparsely-observed data. We show that this system obtains improved few-shot learning performance for novel features over existing imputation and meta-learning baselines across recommender systems, e-learning, and healthcare tasks.

cs.LG↗

arXiv2021

Numerical Energy Analysis of In-wheel Motor Driven Autonomous Electric Vehicles

Autonomous electric vehicles are being widely studied nowadays as the future technology of ground transportation, while the autonomous electric vehicles based on conventional powertrain system limit their energy and power transmission efficiencies and may hinder their broad applications in future. Here we report a study on the energy consumption and efficiency improvement of a mid-size autonomous electric vehicle driven by in-wheel motors, through the development of a numerical energy model, validated with the actual driving data and implemented in a case study. The energy analysis was conducted under three driving conditions: flat road, upslope, and downslope driving to examine the energy consumption, with the energy-saving potential of the in-wheel-motor driven powertrain system systematically explored and discussed. Considering the energy recovery from the regenerative braking, energy consumption and regenerated energy were calculated in specific driving cycles based on vehicle dynamics and autonomous driving patterns. A case study was conducted using the baseline electric vehicle driving data in West Los Angeles. It was found that an in-wheel motor driven autonomous electric vehicle can save up to 17.5% of energy compared with a conventional electric vehicle during the slope driving. Using the efficiency maps of a commercial in-wheel motor, the numerical energy model and validated results obtained from this study are in line with actual situations, and can be used to support sustainable development of more energy-efficient autonomous electric vehicles in the future.

cs.RO↗

arXiv2021

Results and Insights from Diagnostic Questions: The NeurIPS 2020 Education Challenge

This competition concerns educational diagnostic questions, which are pedagogically effective, multiple-choice questions (MCQs) whose distractors embody misconceptions. With a large and ever-increasing number of such questions, it becomes overwhelming for teachers to know which questions are the best ones to use for their students. We thus seek to answer the following question: how can we use data on hundreds of millions of answers to MCQs to drive automatic personalized learning in large-scale learning scenarios where manual personalization is infeasible? Success in using MCQ data at scale helps build more intelligent, personalized learning platforms that ultimately improve the quality of education en masse. To this end, we introduce a new, large-scale, real-world dataset and formulate 4 data mining tasks on MCQs that mimic real learning scenarios and target various aspects of the above question in a competition setting at NeurIPS 2020. We report on our NeurIPS competition in which nearly 400 teams submitted approximately 4000 submissions, with encouragingly diverse and effective approaches to each of our tasks.

cs.CY↗

arXiv2021

WLAN-Log-Based Superspreader Detection in the COVID-19 Pandemic

Identifying "superspreaders" of disease is a pressing concern for society during pandemics such as COVID-19. Superspreaders represent a group of people who have much more social contacts than others. The widespread deployment of WLAN infrastructure enables non-invasive contact tracing via people's ubiquitous mobile devices. This technology offers promise for detecting superspreaders. In this paper, we propose a general framework for WLAN-log-based superspreader detection. In our framework, we first use WLAN logs to construct contact graphs by jointly considering human symmetric and asymmetric interactions. Next, we adopt three vertex centrality measurements over the contact graphs to generate three groups of superspreader candidates. Finally, we leverage SEIR simulation to determine groups of superspreaders among these candidates, who are the most critical individuals for the spread of disease based on the simulation results. We have implemented our framework and evaluate it over a WLAN dataset with 41 million log entries from a large-scale university. Our evaluation shows superspreaders exist on university campuses. They change over the first few weeks of a semester, but stabilize throughout the rest of the term. The data also demonstrate that both symmetric and asymmetric contact tracing can discover superspreaders, but the latter performs better with daily contact graphs. Further, the evaluation shows no consistent differences among three vertex centrality measures for long-term (i.e., weekly) contact graphs, which necessitates the inclusion of SEIR simulation in our framework. We believe our proposed framework and these results may provide timely guidance for public health administrators regarding effective testing, intervention, and vaccination policies.

cs.SI↗

arXiv2021

Educational Question Mining At Scale: Prediction, Analysis and Personalization

Online education platforms enable teachers to share a large number of educational resources such as questions to form exercises and quizzes for students. With large volumes of available questions, it is important to have an automated way to quantify their properties and intelligently select them for students, enabling effective and personalized learning experiences. In this work, we propose a framework for mining insights from educational questions at scale. We utilize the state-of-the-art Bayesian deep learning method, in particular partial variational auto-encoders (p-VAE), to analyze real students' answers to a large collection of questions. Based on p-VAE, we propose two novel metrics that quantify question quality and difficulty, respectively, and a personalized strategy to adaptively select questions for students. We apply our proposed framework to a real-world dataset with tens of thousands of questions and tens of millions of answers from an online education platform. Our framework not only demonstrates promising results in terms of statistical metrics but also obtains highly consistent results with domain experts' evaluation.

cs.CY↗

arXiv2021

TeethTap: Recognizing Discrete Teeth Gestures Using Motion and Acoustic Sensing on an Earpiece

Teeth gestures become an alternative input modality for different situations and accessibility purposes. In this paper, we present TeethTap, a novel eyes-free and hands-free input technique, which can recognize up to 13 discrete teeth tapping gestures. TeethTap adopts a wearable 3D printed earpiece with an IMU sensor and a contact microphone behind both ears, which works in tandem to detect jaw movement and sound data, respectively. TeethTap uses a support vector machine to classify gestures from noise by fusing acoustic and motion data, and implements K-Nearest-Neighbor (KNN) with a Dynamic Time Warping (DTW) distance measurement using motion data for gesture classification. A user study with 11 participants demonstrated that TeethTap could recognize 13 gestures with a real-time classification accuracy of 90.9% in a laboratory environment. We further uncovered the accuracy differences on different teeth gestures when having sensors on single vs. both sides. Moreover, we explored the activation gesture under real-world environments, including eating, speaking, walking and jumping. Based on our findings, we further discussed potential applications and practical challenges of integrating TeethTap into future devices.

cs.HC↗

arXiv2021

Incident-angle dependence of deformation characteristics of aluminum surface under low-energy xenon-ion impact

Ion thruster is a revolution technology with potential applications in space mission but the thrusters operation lifetime is limited by the sputtering from thruster components. In this work, molecular dynamic simulations are performed to explore the dependence of deformation characteristics of an aluminum surface on incident angle and kinetic energy under low-energy xenon-ion impact. The fraction of non-12-coordinated atoms is used to quantitatively characterize the microstructural evolution and defect density levels. It is found that defect density level has a linear relation with incident energy, and there exists a critical incident angle around 20 degrees, at which the aluminum surface has the maximum defect density level. In addition, a collision model is developed to theoretically reveal the physical mechanisms behind the dependence. Our findings may helpful in developing long endurance electric propulsion devices for practical applications.

cond-mat.mtrl-sci↗

arXiv2021

A Causal View on Robustness of Neural Networks

We present a causal view on the robustness of neural networks against input manipulations, which applies not only to traditional classification tasks but also to general measurement data. Based on this view, we design a deep causal manipulation augmented model (deep CAMA) which explicitly models possible manipulations on certain causes leading to changes in the observed effect. We further develop data augmentation and test-time fine-tuning methods to improve deep CAMA's robustness. When compared with discriminative deep neural networks, our proposed model shows superior robustness against unseen manipulations. As a by-product, our model achieves disentangled representation which separates the representation of manipulations from those of other latent causes.

cs.LG↗

arXiv2021

Estimating $α$-Rank by Maximizing Information Gain

Game theory has been increasingly applied in settings where the game is not known outright, but has to be estimated by sampling. For example, meta-games that arise in multi-agent evaluation can only be accessed by running a succession of expensive experiments that may involve simultaneous deployment of several agents. In this paper, we focus on $α$-rank, a popular game-theoretic solution concept designed to perform well in such scenarios. We aim to estimate the $α$-rank of the game using as few samples as possible. Our algorithm maximizes information gain between an epistemic belief over the $α$-ranks and the observed payoff. This approach has two main benefits. First, it allows us to focus our sampling on the entries that matter the most for identifying the $α$-rank. Second, the Bayesian formulation provides a facility to build in modeling assumptions by using a prior over game payoffs. We show the benefits of using information gain as compared to the confidence interval criterion of ResponseGraphUCB (Rowland et al. 2019), and provide theoretical results justifying our method.

cs.MA↗