New framework for attributing online marketing touchpoints.
problem Fine-grained attribution of individual touchpoints' effects.
method Graphical point process framework for studying conversion effects.
result Proposed methods allocate proper credit to touchpoints for each customer's path.
A system for attributing ad effects using a neural network and Shapley values.
problem Attributing ad effects to individual ads in a complex, sequential environment.
method A two-step approach: response modeling with RNN and credit allocation with Shapley values.
result The system accurately allocates incremental ad effects to individual ads, handling sequence dependence.
Customers are usually exposed to online digital advertisement channels, such as email marketing, display advertising, paid search engine marketing, along their way to purchase or subscribe products( aka. conversion). The marketers track all the customer journey data and try to measure the effectiveness of each advertis…
We propose a fully automatic method for learning gestures on big touch devices in a potentially multi-user context. The goal is to learn general models capable of adapting to different gestures, user styles and hardware variations (e.g. device sizes, sampling frequencies and regularities). Based on deep neural networks…
TACTO simulates high-resolution touch sensing for robotics.
problem Accurate simulation of touch sensing in robotics.
method Fast, flexible, open-source simulator for vision-based tactile sensors.
result Demonstrated TACTO's effectiveness in grasping stability prediction and marble manipulation control.
This paper explores supervised techniques for continuous anomaly detection from biometric touch screen data. A capacitive sensor array used to mimic a touch screen as used to collect touch and swipe gestures from participants. The gestures are recorded over fixed segments of time, with position and force measured for e…
Designs a Cellular Automata rule for forming touching loop patterns.
problem Forming stable touching loop patterns in a 2D grid.
method Developed a Cellular Automata rule that uses templates to cover the space and match patterns.
result The rule successfully evolves stable touching loop patterns in a 2D grid.
Embed nodes with multi-scale attributes for robust network analysis.
problem Capturing complex node attributes across different scales.
method Multi-scale attributed node embedding (AE & MUSAE) using Skip-gram approach.
result Proves node-feature mutual information is implicitly factorized by embeddings.
A successful grasp requires careful balancing of the contact forces. Deducing whether a particular grasp will be successful from indirect measurements, such as vision, is therefore quite challenging, and direct sensing of contacts through touch sensing provides an appealing avenue toward more successful and consistent …
Unified analysis for graph learning from multi-attribute Gaussian time series.
problem Estimating conditional independence graph from multi-attribute Gaussian time series data.
method Unified theoretical analysis using a penalized log-likelihood objective function in the frequency domain.
result Established sufficient conditions for consistency and graph recovery in high-dimensional settings.
Machine learning improves ASD diagnosis accuracy.
problem Early detection and treatment of ASD.
method Machine learning, specifically SMO-SVM and Relief Attributes.
result SMO-SVM classifier outperforms other algorithms in ASD detection.
Paper analyzes multi-attribute data to estimate differences in Gaussian graphical models.
problem Estimating differences in two Gaussian graphical models with similar structure.
method Group lasso penalized D-trace loss function and ADMM algorithm for optimization.
result Consistency in support recovery and estimation in high-dimensional settings established.
Framework detects and classifies multi-label RBC images from microscopic images.
problem Challenges in separating touching or overlapping cells for classification.
method Region proposal model + CNN feature extraction + multi-label prediction networks.
result Framework achieves good performance in automatic cell detection and classification.
Unified analysis of multi-attribute graph learning with non-convex penalties.
problem Graph inference from multi-attribute data.
method Penalized log-likelihood objective function with ADMM and local linear approximation.
result Local consistency in support recovery and precision matrix estimation for non-convex penalties.
A new copula model for multi-attribute data using optimal transport.
problem Relaxing the Gaussian assumption for multi-attribute graphical models.
method Introducing a new copula (Cyclically Monotone Copula) and using optimal transport theory.
result The model allows arbitrary continuous distributions and is more flexible than classical methods.
Many real world network problems often concern multivariate nodal attributes such as image, textual, and multi-view feature vectors on nodes, rather than simple univariate nodal attributes. The existing graph estimation methods built on Gaussian graphical models and covariance selection algorithms can not handle such d…
The paper tackles multi-level fairness in algorithmic systems, addressing bias at both individual and structural levels.
problem Algorithmic systems can unfairly impact marginalized groups, especially when considering only individual-level bias.
method Formalizes multi-level fairness using causal inference tools, addressing effects of sensitive attributes at multiple levels.
result Illustrates the importance of accounting for macro-level sensitive attributes in fairness assessments.
Paper teaches robots to play piano with touch and learning.
problem Teaching robots to play piano with touch and emotion.
method Reinforcement learning from scratch with touch-augmented reward and curriculum.
result Robots can play piano with correct key positions and various requirements.
Study evaluates consistency of feature attribution in deep learning for multi-omics data.
problem Challenges in interpretability of deep learning models in biological research.
method Investigation of Shapley Additive Explanations (SHAP) on multi-view deep learning models applied to multi-omics data.
result SHAP rankings are sensitive to architecture and random initialization, suggesting caution.
A new method improves node classification in graphs with limited labels.
problem Semi-supervised multi-label node classification in attributed graphs.
method Collaborative Graph Walk (Multi-Label-Graph-Walk) using reinforcement learning.
result Significantly better multi-label classification performance compared to state-of-the-art methods.
Estimates KL divergence with fairness considerations for sub-populations.
problem Fairly estimate KL divergence between distributions considering sub-populations.
method Proposes multi-group attribution for KL divergence estimation, derived from multi-calibration.
result Shows multi-group attribution provides better KL divergence estimates conditioned on sub-populations.
Enhances persona-based conversation model for multi-turn dialogue.
problem Improving persona-based conversation models for multi-turn dialogue.
method Introduced additional input modality into hredGAN to capture external attributes.
result Persona hredGAN (phredGAN) outperforms existing models in multi-turn dialogue corpora. Develops a method to learn personalized attribute preferences from diverse annotators.
problem Learning attribute preferences from a wide spectrum of annotators with varying interests.
method Multi-task approach with AUC-based loss function and closed-form solution.
result Empirically validated method outperforms traditional consensus-based methods.
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 …
Multi-party machine learning leaks global dataset properties even with black-box access.
problem Leakage of global dataset properties in multi-party machine learning.
method Demonstrated leakage of sensitive attribute distributions in pooled data.
result A curious party can infer sensitive attribute distributions in other parties' data with high accuracy.
Paper estimates differences in multi-attribute Gaussian graphical models using non-convex penalties.
problem Estimating differences in multi-attribute Gaussian graphical models with similar structure.
method Penalized D-trace loss function with non-convex (log-sum and SCAD) penalties, proximal gradient descent methods.
result Theoretical analysis and numerical examples support consistency in support recovery and estimation.
Algorithm optimizes a single attribute in multi-armed bandits with constraints.
problem Optimizing a single attribute under multiple constraints in multi-armed bandits.
method Successive Rejects framework, information theoretic lower bound.
result Upper bound on probability of error decays exponentially with budget, nearly optimal in certain cases.
Proposes a new method for optimizing designs based on uncertain preferences.
problem Optimizing designs with uncertain and time-consuming preferences.
method Bayesian optimization with preference learning for multi-attribute optimization.
result Produces a menu of designs and attributes for the DM to choose from.
Ground-A-Video edits videos without training, preserving intended changes.
problem Complex multi-attribute video editing with omitted or wrong changes.
method Grounding-guided video-to-video translation with Cross-Frame Gated Attention.
result Zero-shot multi-attribute video editing with improved accuracy and frame consistency.
Paper tackles online task allocation in multi-attribute social sensing.
problem Optimized task allocation in dynamic, multi-attribute social sensing.
method Quality-Cost-Aware Online Task Allocation (QCO-TA) scheme using online reinforcement learning.
result Significantly outperforms state-of-the-art baselines in sensing accuracy and cost.
Algorithm minimizes regret in multi-criteria bandits with constraints.
problem Optimize primary attribute while respecting secondary constraints.
method Con-LCB algorithm that guarantees logarithmic regret and feasibility identification.
result Logarithmic regret and feasibility identification with high probability.
Proposes a calibration method for various volatility models.
problem Calibrating local-stochastic and path-dependent volatility models to options.
method Generic calibration framework using forward PIDE and particle method.
result Calibration well within market no-touch bid--ask range.
Lipschitz equivalence of self-similar sets is an important area in the study of fractal geometry. It is known that two dust-like self-similar sets with the same contraction ratios are always Lipschitz equivalent. However, when self-similar sets have touching structures the problem of Lipschitz equivalence becomes much …
Enhances dialogue model with persona attributes using adversarial learning.
problem Improving dialogue models to better capture speaker identity and topic.
method Adversarial learning framework with a dual discriminator system.
result phredGAN outperforms persona Seq2Seq model in various datasets.
Revealed preference theory studies the possibility of modeling an agent's revealed preferences and the construction of a consistent utility function. However, modeling agent's choices over preference orderings is not always practical and demands strong assumptions on human rationality and data-acquisition abilities. Th…
FairICP addresses equalized odds fairness for multiple sensitive attributes.
problem Equalized odds fairness for multiple sensitive attributes.
method Adversarial learning with inverse conditional permutation.
result Promotes equalized odds under complex, multi-dimensional sensitive attributes.
New framework detects out-of-distribution data by considering intrinsic ID attributes in outliers.
problem Deploying reliable machine learning systems requires effective out-of-distribution detection.
method Structured multi-view-based out-of-distribution detection learning (MVOL) framework.
result MVOL effectively utilizes both auxiliary OOD datasets and wild datasets with noisy in-distribution data.
Model infers functions for attributes using multi-aggregate datasets with knowledge transfer.
problem Modeling aggregate data with varying granularities and spatial supports.
method Multi-output Gaussian process (MoGP) with linear mixing of independent latent GPs, aggregation process, and prior distribution of mixing weights.
result Proposed model outperforms in refining coarse-grained aggregate data.
Graph embedding is an important approach for graph analysis tasks such as node classification and link prediction. The goal of graph embedding is to find a low dimensional representation of graph nodes that preserves the graph information. Recent methods like Graph Convolutional Network (GCN) try to consider node attri…
Recent work has explored how to train machine learning models which do not discriminate against any subgroup of the population as determined by sensitive attributes such as gender or race. To avoid disparate treatment, sensitive attributes should not be considered. On the other hand, in order to avoid disparate impact,…
ETNA model predicts demographic attributes from transactions.
problem Predicting demographic attributes from transaction histories with limited data.
method Embedding Transformation Network with Attention (ETNA) model.
result ETNA model outperforms previous models on all tasks.
This paper tackles graph translation challenges by predicting both node and edge attributes simultaneously.
problem Challenges in predicting both node and edge attributes in graph translation, especially in interactive, iterative, and asynchronous processes.
method Developed a novel framework integrating both node and edge translations seamlessly, using spectral graph regularization to maintain consistency.
result Demonstrated the effectiveness of the proposed method on both synthetic and real-world application data.
CAUSE learns Granger causality from event sequences, outperforming existing methods.
problem Learning Granger causality from complex, interdependent event sequences.
method CAUSE uses a neural point process to capture interdependency and an attribution method to extract Granger causality.
result CAUSE outperforms state-of-the-art methods in inferring inter-type Granger causality.
Two modifications improve classifier chains for multi-label classification.
problem Discrepancy between training and testing feature spaces in classifier chains.
method Proposed modifications to address attribute noise.
result Improved prediction performance in challenging cases.
Framework for multi-view redescription mining overcomes limitations of existing approaches.
problem Challenges in revealing non-trivial associations between different subsets of attributes (views).
method Memory-efficient, extensible framework using multi-target regression or multi-label classification algorithms.
result Framework can generate redescriptions from multiple views, improving over existing two-view approaches.
This paper proposes a general framework of multi-armed bandit (MAB) processes by introducing a type of restrictions on the switches among arms evolving in continuous time. The Gittins index process is constructed for any single arm subject to the restrictions on switches and then the optimality of the corresponding Git…
CollaQ improves multi-agent performance in StarCraft by 40% with fewer samples.
problem Limited generalization and high training rounds in multi-agent reinforcement learning.
method Formulates multi-agent collaboration as joint optimization on reward assignment, decomposes Q-function into self and interactive terms, and uses MARA loss.
result Improves win rate by 40% in StarCraft maps with same number of samples compared to state-of-the-art techniques.
Discrete-AIR model identifies objects in images with interpretable latent codes.
problem Identifying objects in images without labeled data.
method Recurrent Auto-Encoder with structured latent distributions for discrete, continuous, and spatial attention.
result Discrete-AIR model uses minimal latent variables for efficient inference.