New gait segmentation method identifies users and adversaries with high accuracy.
problem Simultaneous identification of users and adversaries from accelerometer data.
method Geometric features and a new similarity metric for time series analysis.
result 98.79% accuracy for 6 classes (user-adversary identification) and 99.06% for binary (user only identification).
Study on adversarial attacks on user identification systems using motion sensors.
problem Adversarial attacks on deep learning models for user identification based on motion sensors.
method Study of adversarial example generation methods and their impact on user identification systems.
result Deep neural networks trained for user identification based on motion sensors are vulnerable to adversarial attacks, leading to high misclassification rates.
An adversarial process between two deep neural networks is a promising approach to train a robust model. In this paper, we propose an adversarial process using cosine similarity, whereas conventional adversarial processes are based on inverted categorical cross entropy (CCE). When used for training an identification mo…
New algorithm optimally identifies best arm in both stochastic and adversarial settings.
problem Best arm identification in stochastic and adversarial reward scenarios.
method Parameter-free algorithm designed to be robust to adversarial rewards and optimal in stochastic problems.
result Algorithm's error rate matches optimal bounds in stochastic problems and is robust to adversarial rewards.
Deep learning methods for person identification based on electroencephalographic (EEG) brain activity encounters the problem of exploiting the temporally correlated structures or recording session specific variability within EEG. Furthermore, recent methods have mostly trained and evaluated based on single session EEG …
Study on generating and identifying languages privately, showing privacy imposes costs and creates barriers.
problem Generating and identifying languages privately in the limit model.
method Introduced a continual release model under differential privacy constraints, proving both positive and negative results.
result Privacy imposes quantitative and qualitative costs, and creates fundamental barriers for identification.
Study robust best-arm identification in linear bandits with lower bounds and algorithms.
problem Identify a near-optimal robust arm in linear bandits with adversarial actions.
method Propose instance-dependent lower bounds and both static and adaptive bandit algorithms.
result Sample complexity matches the lower bound and algorithms effectively identify robust arms.
The paper provides robustness guarantees for mode estimation in bandits.
problem Understanding robustness in mode estimation under adversarial data contamination.
method Simple randomization and theoretical analysis of multi-armed bandits.
result Regret guarantees for various modal bandit problems.
GGA improves untrustworthy prediction detection in neural networks without retraining.
problem Susceptibility of neural networks to untrustworthy predictions, especially adversarial attacks and out-of-distribution data.
method Geometric Gradient Analysis (GGA) analyzes the geometry of neural network loss landscapes based on saliency maps.
result GGA outperforms existing methods in detecting untrustworthy predictions, including adversarial and out-of-distribution data.
A fundamental problem in geophysical modeling is related to the identification and approximation of causal structures among physical processes. However, resolving the bidirectional mappings between physical parameters and model state variables (i.e., solving the forward and inverse problems) is challenging, especially …
The paper tackles best arm identification in contaminated bandits with optimal error guarantees and sample complexity.
problem Best arm identification in stochastic bandits with adversarial reward contamination.
method Proposes two algorithms: a gap-based algorithm and a successive elimination-based algorithm for sub-Gaussian bandits.
result Asymptotically optimal sample complexity for both algorithms.
Algorithm identifies Pareto set in bandits with contaminated feedback.
problem Identifying Pareto set in multi-objective bandits with adversarial contamination.
method Sample median-based multi-objective adaptive elimination algorithm.
result Sample complexity bound that depends on contamination probability.
New approach improves robustness of deep neural networks without overfitting.
problem Adversarial vulnerability of deep neural networks.
method Non-zero-sum bilevel formulation of adversarial training.
result Algorithm matches and outperforms state-of-the-art attacks, maintains robustness, and avoids overfitting.
Generative adversarial network synthesizes sketches into realistic images.
problem Improving the quality and realism of facial sketches.
method Hybrid GAN with quality guided encoder and identity preserving network.
result Synthesized images are more realistic and maintain identity.
This study improves UAV identification using RF signals with one-shot generative methods.
problem Limited RF environments and signal variability make traditional RF identification ineffective.
method Introduces one-shot generative methods to augment RF signals for UAV identification.
result One-shot generative methods outperform traditional methods in low-data regimes.
For a data holder, such as a hospital or a government entity, who has a privately held collection of personal data, in which the revealing and/or processing of the personal identifiable data is restricted and prohibited by law. Then, "how can we ensure the data holder does conceal the identity of each individual in the…
It is well-known that many machine learning models are susceptible to adversarial attacks, in which an attacker evades a classifier by making small perturbations to inputs. This paper discusses how industrial copyright detection tools, which serve a central role on the web, are susceptible to adversarial attacks. We di…
Develops asymptotic theory for adversarial estimators.
problem Estimating unknown functions in machine learning and econometrics.
method Derives convergence rates and normality of A-estimators under various conditions.
result Normality of neural-net M-estimators, overcoming previous technical issues.
Paper defends LSTM-based text classification models from backdoor attacks.
problem Backdoor attacks in LSTM models cause misclassification of spam or malicious speech.
method Backdoor Keyword Identification (BKI) to identify and exclude poisoned samples.
result BKI method effectively mitigates backdoor attacks in various text classification datasets.
Paper proposes a framework to protect user anonymity in emotion recognition.
problem Preserving user anonymity in face-based emotion recognition systems.
method Adversarial learning framework using CNN architecture.
result The proposed approach minimizes identity-specific information and maximizes emotion-dependent information.
AugmentedPCA improves PCA with supervised or adversarial objectives.
problem Lack of reproducible linear analogs for deep latent factor models.
method Augments PCA with supervised or adversarial objectives.
result Improves downstream classification performance and identifies cancer-related genes.
A novel method using saliency maps detects adversarial attacks effectively.
problem Vulnerability of neural networks to adversarial attacks.
method Combining saliency maps with additional noises and inconsistency strategy.
result High detection success rate of adversarial attacks on various datasets.
Improved reliability of machine learning predictions using variational auto-encoders.
problem Individual unreliability of machine learning models.
method Modified variational auto-encoders to identify a low-dimensional space for reliable classification.
result Improved reliability of predictions and robust identification of adversarial samples.
The use of deep networks to extract embeddings for speaker recognition has proven successfully. However, such embeddings are susceptible to performance degradation due to the mismatches among the training, enrollment, and test conditions. In this work, we propose an adversarial speaker verification (ASV) scheme to lear…
Efficiently controls unknown linear systems with black-box interactions.
problem Controlling an unknown linear dynamical system from black-box interactions.
method First efficient algorithm with sublinear regret, using robust system identification.
result Resolves open problem on stochastic LQR and black-box LQR control.
Learning causal effects from observational data greatly benefits a variety of domains such as health care, education and sociology. For instance, one could estimate the impact of a new drug on specific individuals to assist the clinic plan and improve the survival rate. In this paper, we focus on studying the problem o…
We consider the decentralized exploration problem: a set of players collaborate to identify the best arm by asynchronously interacting with the same stochastic environment. The objective is to insure privacy in the best arm identification problem between asynchronous, collaborative, and thrifty players. In the context …
Noiseless IO bounds inferred from demonstrations, matching adversarial settings.
problem Inferring decision-maker's objective from observed data.
method High-probability generalization bounds for induced action set.
result Generalization bound of O(Td) for consistent estimators. Access to medical data is highly restricted due to its sensitive nature, preventing communities from using this data for research or clinical training. Common methods of de-identification implemented to enable the sharing of data are sometimes inadequate to protect the individuals contained in the data. For our researc…
Unified framework improves cross-corpus EEG emotion recognition by aligning prototypes and refining decision boundaries.
problem Cross-corpus EEG emotion recognition suffers from performance degradation due to physiological variability and device inconsistencies.
method Prototype-driven Adversarial Alignment (PAA) framework with three configurations: local, contrastive, and boundary-aware.
result State-of-the-art performance improvements across four cross-corpus evaluation protocols.
Proposes a method to estimate treatment effects using instruments.
problem Estimating treatment effects from observational data is challenging when unconfoundedness is violated.
method Leverages instruments to estimate bounds on conditional average treatment effect (CATE) through a mapping to a discrete representation space and a two-step procedure.
result Demonstrates theoretical validity and reduced estimation variance in finite-sample settings.
Person Re-identification (re-id) faces two major challenges: the lack of cross-view paired training data and learning discriminative identity-sensitive and view-invariant features in the presence of large pose variations. In this work, we address both problems by proposing a novel deep person image generation model for…
Recent studies have highlighted that deep neural networks (DNNs) are vulnerable to adversarial attacks, even in a black-box scenario. However, most of the existing black-box attack algorithms need to make a huge amount of queries to perform attacks, which is not practical in the real world. We note one of the main reas…
Deep learning is at the core of recent spoken language understanding (SLU) related tasks. More precisely, deep neural networks (DNNs) drastically increased the performances of SLU systems, and numerous architectures have been proposed. In the real-life context of theme identification of telephone conversations, it is c…
Study efficient reinforcement learning for partially observed systems with linear structure.
problem Efficient reinforcement learning for partially observed Markov decision processes with linear structure.
method Proposes OP-TENET algorithm using a Bellman operator with finite memory, adversarial integral equation, and optimistic exploration.
result Achieves ε-optimal policy within O(1/ε^2) episodes with polynomial sample complexity in intrinsic dimension.
Authentication is a task aiming to confirm the truth between data instances and personal identities. Typical authentication applications include face recognition, person re-identification, authentication based on mobile devices and so on. The recently-emerging data-driven authentication process may encounter undesired …
FAIR-NN finds invariant variables for causal inference across diverse environments.
problem Nonparametric invariance and causal learning in regression models with varying joint distributions.
method FAIR-NN framework using adversarial optimization and neural networks.
result FAIR-NN identifies invariant variables and quasi-causal variables under minimal conditions.
This work investigates training infinite mixtures with maximum likelihood for improved uncertainty quantification.
problem Improving uncertainty quantification in neural networks.
method Investigates training infinite mixtures with maximum likelihood instead of variational inference.
result The proposed method leads to stochastic networks with increased predictive variance, improved robustness, and higher entropy on out-of-distribution data.
New time series generation models improve accuracy and correlation identification.
problem Generating accurate and correlated time series from limited data.
method Conditional Euler Generator (CEGEN) using Euler discretization of SDEs and Wasserstein metrics.
result CEGEN outperforms state-of-the-art models on various metrics and real-world datasets.
Paper explores using EEG for better speaker identification, even in noisy environments.
problem Speaker identification performance degrades in background noise.
method Uses EEG signals to enhance speaker identification systems, comparing with acoustic features.
result Speaker identification system using only EEG features outperforms one using only acoustic features in high background noise.
New algorithm identifies best arm in non-stationary linear bandits with improved complexity.
problem Best arm identification in non-stationary linear bandits with adversarial parameters.
method Proposed Adjacent-optimal design and extsfAdjacent−BAI algorithm. result Error probability matches arm-set-dependent lower bound up to constants.
New method for personalized pricing using invalid instrumental variables.
problem Personalized pricing under endogeneity with limited standard methods.
method PRINT method for continuous treatment, solving conditional moment restrictions.
result Established optimal pricing strategy under endogeneity with invalid instrumental variables.
Deep neural networks (DNNs) are one of the most prominent technologies of our time, as they achieve state-of-the-art performance in many machine learning tasks, including but not limited to image classification, text mining, and speech processing. However, recent research on DNNs has indicated ever-increasing concern o…
New model detects anomalies robustly in noisy, seasonal multivariate time series.
problem Detecting anomalies in noisy, seasonal multivariate time series data.
method Proposes Robust Seasonal Multivariate Generative Adversarial Network (RSM-GAN).
result Improves robustness and precision in detecting anomalies.
We describe an optimal adversarial attack formulation against autoregressive time series forecast using Linear Quadratic Regulator (LQR). In this threat model, the environment evolves according to a dynamical system; an autoregressive model observes the current environment state and predicts its future values; an attac…
In the present paper we study interval identification systems of order three. We prove that the Rauzy induction preserves symmetry: for any symmetric interval identification system of order three after finitely many iterations of the Rauzy induction we always obtain a symmetric system. We also provide an example of sym…
Simplified identification methods for causal inference with arbitrary interventional distributions.
problem Estimating cause-effect relationships from data with experimental interventions.
method Using Single World Intervention Graphs and nested model factorization, we provide algorithms for identifying causal parameters from mixed observational and interventional distributions.
result Our algorithms are complete for certain types of interventional marginal distributions.
Cyclic coordinate descent identifies models in finite time and converges linearly.
problem Model identification in composite nonsmooth optimization problems.
method Cyclic coordinate descent for a wide class of functions.
result Explicit local linear convergence rates for coordinate descent.