New framework compares two stochastic learning dynamics in games.
problem Inability to distinguish between different learning rules leading to the same steady-state behavior.
method Developed a framework for comparative analysis of stochastic learning dynamics with different update rules.
result Identified distinct behaviors in the paths to stochastically stable states for LLL and ML.
Paper estimates area covered by a line-sweep sensor in robotics.
problem Accurately estimating the area covered by a line-sweep sensor.
method Relies on coverage measure and topological degree in the plane.
result Guaranteed characterization of the explored area using interval analysis.
Study efficient offline RL in Markov games with general models.
problem Learn approximate equilibria from offline data in Markov games.
method Use Bellman-consistent pessimism for interval estimation and optimize gap relaxation.
result First framework for sample-efficient offline learning in Markov games, handling all equilibria.
A new approach guarantees complete mode coverage in generative models.
problem Missing modes in generative models.
method Game-theoretic perspective and multiplicative weights update rule.
result Guaranteed complete mode coverage through generator mixture.
This work designs secure DSVMs against adversaries using game theory.
problem Adversaries can deceive DSVMs leading to misclassification and misprediction.
method Game-theoretic framework to model DSVM learner and attacker interactions, finding Nash equilibrium.
result DSVM learner is less vulnerable with balanced networks and more training samples.
New approach for adaptive conformal inference using Blackwell's theory.
problem Non-exchangeable environments in sequential conformal inference.
method Reinterpretation of ACI as a game, construction of coverage and efficiency objectives, approachability strategy.
result Algorithm achieves strong theoretical guarantees and practical insights.
Automatic detection of reflective thinking in math problem solving using body movement data.
problem Detecting reflective thinking in children's mathematical problem solving.
method WeDraw-1 Movement Dataset, Long Short-Term Memory neural networks, end-to-end detection.
result Average F1 scores of 0.73 for automatic detection and 0.79 for end-to-end detection of reflective thinking.
Decentralised optimisation tasks are important components of multi-agent systems. These tasks can be interpreted as n-player potential games: therefore game-theoretic learning algorithms can be used to solve decentralised optimisation tasks. Fictitious play is the canonical example of these algorithms. Nevertheless fic…
ActiLabel learns activity patterns across diverse sensor devices.
problem Limited adoption of activity recognition models across different domains due to diverse sensor devices.
method Combination of graph model and optimal tiered mapping for learning activity labels.
result Superior performance compared to state-of-the-art methods on public datasets.
Real-time event detection using human sensor data and adaptive machine learning.
problem Lack of effective real-time event detection using human sensor data.
method Combination of corroborative and probabilistic sources with drift adaptive machine learning.
result Automated continuous learning maintains high performance in the face of concept drift.
DASC combines social media and car sensors to improve disaster response.
problem Inconsistent reliability and inconsistent availability of human sensors.
method Hybrid social-car sensing system using game theory, feedback control, and MDP.
result DASC improves detection accuracy and efficiency in disaster response.
The paper tackles temporal coverage bias in financial panel data, proposing a structuring framework to correct for incomplete histories.
problem Incomplete histories of financial instruments lead to biased panel data.
method Formalizes the problem and proposes a coverage-aware structuring framework using structured metadata and an availability matrix.
result The framework reveals substantial distortions in return dynamics and volatility when naive temporal alignment is used.
Unified framework for estimating reward functions in competitive games.
problem Estimating unknown reward functions in competitive games.
method Unified framework with entropy regularization for reward function recovery.
result Strong theoretical guarantees and practical effectiveness demonstrated.
Wearable tech detects table tennis shots with high accuracy.
problem Lack of shot detection in table tennis using wearables.
method Fusion of IMU and audio sensor data for real-time shot detection.
result 95.6% accuracy in shot detection.
DFTerNet improves human activity recognition on portable devices with 2-bit quantization and dynamic fusion.
problem Resource constraints and unequal fusion strategies limit practical human activity recognition on portable devices.
method 2-bit Convolutional Neural Networks with dynamic fusion strategies for different activity types.
result Exceeds baseline model performance by up to ~5% on OPPORTUNITY and PAMAP2 datasets.
Introduces GANGs to model GANs as games, solving them with RB-NE.
problem Training difficulties in GANs.
method Explicitly models GANs as a zero-sum game between generator and classifier using mixed strategies, defines resource-bounded best responses and Nash Equilibrium.
result Solves GANGs with RB-NE, demonstrating better performance than standard GANs.
This research develops secure DSVM algorithms using game theory.
problem Vulnerability of DSVM in adversarial environments.
method Game-theoretic framework to model conflicting interests between adversary and DSVM units.
result Guaranteed convergence of distributed learning algorithms without data or network topology assumptions.
Pessimistic model-based algorithm finds Nash equilibria in zero-sum Markov games from offline data.
problem Learning Nash equilibria in two-player zero-sum Markov games from limited data.
method Pessimistic model-based algorithm with Bernstein-style lower confidence bounds (VI-LCB-Game).
result Proves sample complexity no larger than C c l i p p e d ⋆ S ( A + B ) ( 1 − γ ) 3 ε 2 \frac{C_{\mathsf{clipped}}^\star S(A+B)}{(1-γ)^3 \varepsilon^2} ( 1 − γ ) 3 ε 2 C clipped ⋆ S ( A + B ) , achieving minimax optimality. Modeling reinsurance market, we find subgame perfect Nash equilibria.
problem Optimizing reinsurance market with multiple insurers and reinsurers.
method Sequential game with Subgame Perfect Nash Equilibria analysis.
result Characterized subgame perfect Nash equilibria in some market cases.
This paper tackles global Nash equilibrium in non-convex multi-player games.
problem Challenges in finding global Nash equilibrium due to non-convexity.
method Conjugate transformation and variational inequality formulation to prove existence and design algorithms.
result Designs an ODE-based algorithm with exponential convergence rate and proves its effectiveness in practical scenarios.
Deep-MAPS uses machine learning for mobile air pollution sensing in Beijing.
problem Ubiquitous sensing of urban air quality.
method Machine learning framework (Deep-MAPS) based on mobile and fixed sensors.
result Deep-MAPS achieves high spatial-temporal resolution (1km-by-1km and 1 hour) with over 85% accuracy.
Pessimistic Minimax Value Iteration finds efficient NE policies from offline data.
problem Finding an approximate Nash equilibrium in offline Markov games with non-uniform coverage.
method Pessimistic Minimax Value Iteration (PMVI) constructs pessimistic value function estimates and solves NEs.
result Established a nearly minimax optimal result for offline Markov games with function approximation.
This paper tackles traffic volume estimation challenges with a deep learning method.
problem Underdetermined and non-equilibrium traffic flows.
method Graph-based deep learning method with adaptive attention mechanisms.
result The proposed model achieves high accuracy even with low sensor coverage.
A new algorithm improves offline reinforcement learning robustness.
problem Finding optimal policies in perturbed environments from offline data.
method Doubly Pessimistic Model-based Policy Optimization (P^2MPO) framework.
result Proves sample efficiency with robust partial coverage data.
CMCO provides robust uncertainty estimates for neural operators without retraining.
problem Uncertainty quantification in deep learning for real-time virtual sensing.
method Unified Monte Carlo dropout and split conformal prediction in DeepONet.
result Near-nominal empirical coverage in diverse applications.
This work builds a sensor graph from DC sensors for anomaly detection.
problem Anomaly detection in data centers with complex sensor relationships.
method Data-driven pipeline (ts2graph) to build a sensor graph from sensor time series.
result Graph neural network (GNN) outperforms existing methods by 2-3 times in anomaly detection.
New RL method explores environments without rewards, achieving efficient policy generation.
problem Efficiently exploring unknown environments without predefined rewards.
method Optimistic value-iteration algorithm with kernel and neural function approximations.
result Achieves O ~ ( 1 / ε 2 ) \widetilde{\mathcal{O}}(1 /\varepsilon^2) O ( 1/ ε 2 ) sample complexity for generating policies or equilibria. Develops efficient algorithms for spatial field reconstruction and sensor selection in heterogeneous weather sensor networks.
problem Efficient spatial field reconstruction and query-based sensor set selection in heterogeneous sensor networks.
method Spatial Best Linear Unbiased Estimator (S-BLUE) and Cross Entropy method.
result Efficient algorithms with performance guarantees for spatial field reconstruction and sensor selection.
A new algorithm learns policies from batch data in hierarchical RL.
problem Learning policies from fixed batches of data without full exploration.
method Modeling RL as a two-player game with a leader-follower structure, proposing StackelbergLearner.
result StackelbergLearner achieves competitive performance in batch RL and real-world datasets.
Gamification and deep learning improve energy efficiency in smart buildings.
problem Lack of human engagement and motivation in smart building control.
method Modeling user interaction as a game, integrating IoT sensors and cyber-physical systems, using Deep Learning for forecasting.
result Improved energy efficiency through gamified smart building control.
Improved robustness in multi-modal sensor fusion with deep learning.
problem Inconsistency in fusion weights leading to poor performance under sensor failures.
method Proposes deep multi-modal sensor fusion architectures with fusion weight regularization and target learning.
result Proposed architectures outperform existing deep learning methods under sensor failures.
Proposes a neural network for handling multi-sensor time series with varying input dimensions.
problem Handling multi-sensor time series with varying input dimensions.
method Graph neural network conditioning vectors for zero-shot transfer learning.
result Better generalization in activity recognition and equipment prognostics datasets.
RESPIRE calibrates low-cost air-quality sensors for CO levels, resistant to outliers.
problem Calibrating LCAQ sensors against regulatory-grade monitors is expensive and time-consuming.
method PROvably outlier-resistant semi-parametric regression technique.
result RESPIRE offers improved prediction in cross-site, cross-season, and cross-sensor settings.
Paper proposes a method to reduce sensor drift in electronic noses.
problem Sensor drift in electronic noses.
method Discriminative subspace projection approach.
result The method minimizes within-class variance and maximizes between-class variance using label information.
New RNN model fuses sensor data from multiple stations.
problem Modeling distributed sensor networks for future behavior prediction.
method Multi-Encoder-Decoder RNN architecture with attention mechanism.
result Model improves prediction accuracy on real-world sensor datasets.
Method learns behavioral states from wearable sensor data.
problem Understanding behavioral patterns from sensor data.
method Non-parametric Bayesian approach to model sensor data.
result Learned behavioral states cluster participants into meaningful groups and predict psychological states.
Framework fuses RGB images and depth maps for self-driving car control.
problem Fault tolerance in self-driving cars with sensor failures.
method Deep neural network architecture for sensor fusion.
result Framework can learn to use relevant sensor information even when one fails.
Low-cost sensors improve air quality prediction accuracy significantly.
problem Improving air quality monitoring networks with affordable sensors.
method Developed a high-resolution air quality prediction engine using low-cost sensors and official data.
result The use of low-cost sensors improves prediction accuracy by 25% and 15% for PM2.5 and PM10 respectively in densely monitored areas.
Adversarial approach enhances sensor fusion for robust target detection.
problem Improving target detection and classification using multi-modal sensor fusion.
method Generative network learns latent space from various sensor modalities, then detects damaged sensors and safeguards performance.
result Automatic robustness against noisy/damaged sensors achieved.
Improved DOA estimation with distributed sensors across multiple frequencies.
problem Sensor gain uncertainties and directional perturbations in multi-frequency scenarios.
method Distributed optimization with local coherence models and iterative exchange of information.
result Advantages in statistical and computational efficiency through parallel iterative technique.
Paper presents a WiFi-based indoor sensor localization technique.
problem Indoor localization in wireless sensor networks.
method Zoning-based localization using statistical learning.
result Efficient sensor zone determination in indoor environments.
Regularized recurrent attention filter combines sensor inputs.
problem Combining information from different sensor modalities.
method Regularized recurrent attention filter, co-learning mechanism, probabilistic graphical model.
result Dynamic sensor fusion and latent representation recovery.
Bayesian approach improves rain field reconstruction using CMLs and DMs.
problem Challenges in accurately reconstructing ground-level rainfall from CML path-integrated measurements.
method Bayesian inverse problem with Diffusion Models as priors.
result Improved performance in rainfall estimation compared to existing methods.
A new compressed sensing system speeds up PSTE detection.
problem Accurately detecting fast, small optical events (PSTEs) is challenging.
method Developed a novel compressed sensing algorithm for rolling shutter systems.
result Accurately recovered PSTEs with spatial undersampling, showing speed and quality advantages.
FATHOM model improves sensor data analysis with attention and LSTM.
problem Scarcity of training data from multiple sensors.
method Federated multi-task hierarchical attention model (FATHOM) with attention mechanism and LSTM.
result FATHOM outperforms baselines in sensor data classification and regression.
ConvGNP improves sensor placement for climate monitoring.
problem Maximizing informativeness of environmental sensor placements in remote regions.
method Convolutional Gaussian neural processes (ConvGNP) for non-stationary spatial predictions.
result ConvGNP outperforms traditional GP models in predicting sensor performance and reducing uncertainty.
User interfaces provide an interactive window between physical and virtual environments. A new concept in the field of human-computer interaction is a soft user interface; a compliant surface that facilitates touch interaction through deformation. Despite the potential of these interfaces, they currently lack a signal …
Proposes ANN for robust sensor data prediction.
problem Predicting component health from noisy, failing sensors.
method Artificial Neural Network framework with data augmentation.
result Accurate predictions despite noisy sensor data.