YCYuan Chen

Yuan Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yuan Chen has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Tactile Velocity Estimation for Controlled In-Grasp Sliding

    by Yuan Chen, Colin Prepscius, Daewon Lee, Daniel D. Lee

    This letter studies the problem of controlling the sliding motion of an object held by a robot manipulator. We show how a parallel-jaw gripper can reliably control the motion of a rigid, prism-like object by 1) estimating the object's sliding velocity using measurements from tactile sensors at the gripper's fingertips and 2) controlling the grip strength to regulate the sliding velocity. We first train a neural network to estimate the sliding velocity from only tactile signals with data of tactile sensor measurements associated with various sliding velocities determined by an external motion capture system from repeated sliding trials of 28 different objects varying in size, shape, and surface texture. The velocity estimates from the neural network are then used as feedback for a closed-loop grip controller that maintains the desired sliding velocity. Experimental results show that our neural network estimates the object's sliding velocity with mean squared error under 0.5 $(\text{cm/s})^2$ , generalizes well to objects of new shapes and surface textures, and enables our closed loop grip controller to reliably slide objects at different target velocities.


  • Open Access

    Resilient Distributed Field Estimation

    by Yuan Chen, Soummya Kar, José M. F. Moura

    We study resilient distributed field estimation under measurement attacks. A network of agents or devices measures a large, spatially distributed physical field parameter. An adversary arbitrarily manipulates the measurements of some of the agents. Each agent's goal is to process its measurements and information received from its neighbors to estimate only a few specific components of the field. We present $\mathbf{SAFE}$, the Saturating Adaptive Field Estimator, a consensus+innovations distributed field estimator that is resilient to measurement attacks. Under sufficient conditions on the compromised measurement streams, the physical coupling between the field and the agents' measurements, and the connectivity of the cyber communication network, $\mathbf{SAFE}$ guarantees that each agent's estimate converges almost surely to the true value of the components of the parameter in which the agent is interested. Finally, we illustrate the performance of $\mathbf{SAFE}$ through numerical examples.

  • Resilient Distributed Field Estimation

    by Yuan Chen, Soummya Kar, José M. F. Moura

    We study resilient distributed field estimation under measurement attacks. A network of agents or devices measures a large, spatially distributed physical field parameter. An adversary arbitrarily manipulates the measurements of some of the agents. Each agent's goal is to process its measurements and information received from its neighbors to estimate only a few specific components of the field. We present SAFE, the saturating adaptive field estimator, a consensus+innovations distributed field estimator that is resilient to measurement attacks. Under sufficient conditions on the compromised measurement streams, the physical coupling between the field and the agents' measurements, and the connectivity of the cyber communication network, SAFE guarantees that each agent's estimate converges almost surely to the true value of the components of the parameter in which the agent is interested. Finally, we illustrate the performance of SAFE through numerical examples.


  • Obtain Dark Knowledge via Extended Knowledge Distillation

    by Chen Yuan, Rong Pan

    Training a smaller student model on portable devices such as smart phones to mimic a complex and heavy teacher model through knowledge distillation has received extensive attention. Massive studies have been done on the application of knowledge distillation on various tasks as well as improvement of supervised information while training student model. However, few studies focus on the distillation of "dark knowledge" can be found in teacher model but hard to be expressed directly, which is very important because the training data used to train the teacher model are not always visible to the student model. We extended the method of knowledge distillation in this paper, not only taking the difference of logits between the teacher model and the student model as part of loss function as the basic knowledge distillation method did, but also paying attention to the interior of both models. We divided both teacher model and student model into several segments and made the outputs of these segments as close as possible to form another part of loss function, and this method was referred to as "Extended-KD" (Extended Knowledge Distillation). In our experiment, we used complete CIFAR-10 dataset to train student model as baseline, and then we tried to drop all examples of some labels to train student model through Extended-KD. Our experiment shows that Extended-KD method performs better than the basic knowledge distillation method; and knowledge distillation with incomplete datasets can also enable student model to predict the target labels it has never seen. Therefore, Extended-KD method can obtain dark knowledge properly.


  • Resilient Distributed Parameter Estimation With Heterogeneous Data

    by Yuan Chen, Soummya Kar, Jose M. F. Moura

    This paper studies resilient distributed estimation under measurement attacks. A set of agents each makes successive local, linear, noisy measurements of an unknown vector field collected in a vector parameter. The local measurement models are heterogeneous across agents and may be locally unobservable for the unknown parameter. An adversary compromises some of the measurement streams and changes their values arbitrarily. The agents’ goal is to cooperate over a peer-to-peer communication network to process their (possibly compromised) local measurements and estimate the value of the unknown vector parameter. We present SAGE , the Saturating Adaptive Gain Estimator, a distributed, recursive, consensus + innovations estimator that is resilient to measurement attacks. We demonstrate that, as long as the number of compromised measurement streams is below a particular bound, then, SAGE guarantees that all of the agents’ local estimates converge almost surely to the value of the parameter. The resilience of the estimator – i.e., the number of compromised measurement streams it can tolerate – does not depend on the topology of the inter-agent communication network. Finally, we illustrate the performance of SAGE through numerical examples.


  • Resilient Distributed Estimation: Sensor Attacks

    by Yuan Chen, Soummya Kar, Jose' M. F. Moura

    This paper studies multi-agent distributed estimation under sensor attacks. Individual agents make sensor measurements of an unknown parameter belonging to a compact set, and, at every time step, a fraction of the agents' sensor measurements may fall under attack and take arbitrary values. We present the Saturated Innovation Update (SIU) algorithm for distributed estimation resilient to sensor attacks. Under the iterative SIU algorithm, if less than one half of the agent sensors fall under attack, then, all of the agents' estimates converge at a polynomial rate (with respect to the number of iterations) to the true parameter. The resilience of SIU to sensor attacks does not depend on the topology of the inter-agent communication network, as long as it remains connected. We demonstrate the performance of SIU with numerical examples


  • The Internet of Things: Secure Distributed Inference

    by Yuan Chen, Soummya Kar, Jose M.F. Moura

    The growth in the number of devices connected to the Internet of Things (IoT) poses major challenges in security. The integrity and trustworthiness of data and data analytics are increasingly important concerns in IoT applications. These are compounded by the highly distributed nature of IoT devices, making it infeasible to prevent attacks and intrusions on all data sources. Adversaries may hijack devices and compromise their data. As a result, reactive countermeasures, such as intrusion detection and resilient analytics, become vital components of security. This article overviews algorithms for secure distributed inference in IoT.


  • Open Access

    Resilient Distributed Estimation: Sensor Attacks

    by Yuan Chen, Soummya Kar, José M. F. Moura

    This paper studies multi-agent distributed estimation under sensor attacks. Individual agents make sensor measurements of an unknown parameter belonging to a compact set, and, at every time step, a fraction of the agents' sensor measurements may fall under attack and take arbitrary values. We present the Saturated Innovation Update ($\mathcal{SIU}$) algorithm for distributed estimation resilient to sensor attacks. Under the iterative $\mathcal{SIU}$ algorithm, if less than one half of the agent sensors fall under attack, then, all of the agents' estimates converge at a polynomial rate (with respect to the number of iterations) to the true parameter. The resilience of $\mathcal{SIU}$ to sensor attacks does not depend on the topology of the inter-agent communication network, as long as it remains connected. We demonstrate the performance of $\mathcal{SIU}$ with numerical examples.

  • Resilient Distributed Estimation Through Adversary Detection

    by Yuan Chen, Soummya Kar, Jose M. F. Moura

    This paper studies resilient multi-agent distributed estimation of an unknown vector parameter when a subset of the agents is adversarial. We present and analyze a Flag Raising Distributed Estimator (FRDE) that allows the agents under attack to perform accurate parameter estimation and detect the adversarial agents. The FRDE algorithm is a consensus+innovations estimator in which agents combine estimates of neighboring agents (consensus) with local sensing information (innovations). We establish that, under FRDE, either the uncompromised agents' estimates are almost surely consistent or the uncompromised agents detect compromised agents if and only if the network of uncompromised agents is connected and globally observable. Numerical examples illustrate the performance of FRDE.


  • Open Access

    Resilient Distributed Estimation Through Adversary Detection

    by Yuan Chen, Soummya Kar, José M. F. Moura

    This paper studies resilient multi-agent distributed estimation of an unknown vector parameter when a subset of the agents is adversarial. We present and analyze a Flag Raising Distributed Estimator ($\mathcal{FRDE}$) that allows the agents under attack to perform accurate parameter estimation and detect the adversarial agents. The $\mathcal{FRDE}$ algorithm is a consensus+innovations estimator in which agents combine estimates of neighboring agents (consensus) with local sensing information (innovations). We establish that, under $\mathcal{FRDE}$, either the uncompromised agents' estimates are almost surely consistent or the uncompromised agents detect compromised agents if and only if the network of uncompromised agents is connected and globally observable. Numerical examples illustrate the performance of $\mathcal{FRDE}$.