A new weighted dissimilarity measure reduces positioning errors in feature-based systems.
problem Reducing errors in feature-based positioning systems, especially in areas with high variability.
method Iterative scheme using location-dependent standard deviations as weights.
result Maximum radial positioning error reduced by 40% using the weighted dissimilarity measure.
The paper proposes criteria and methods for evaluating and aggregating feature-based model explanations.
problem Lack of quantitative evaluation criteria for feature-based model explanations.
method Developed quantitative evaluation criteria (low sensitivity, high faithfulness, low complexity), devised a framework for aggregation, and derived a new aggregate Shapley value explanation function.
result A new aggregate Shapley value explanation function that minimizes sensitivity.
Unified framework for feature-based explanations using ANOVA and game theory.
problem Differences between feature-based explanations methods limit their applicability.
method Introduces a unified framework combining fANOVA and cooperative game theory.
result Uncovered similarities and differences between various explanation techniques.
Two algorithms achieve optimal logarithmic regret in feature-based dynamic pricing.
problem Optimal pricing for products with features based on online learning.
method Developed EMLP and ONSP algorithms for stochastic and adversarial settings, proving O(dlogT) regret bounds. result Achieved optimal O(dlogT) regret, improving over existing bounds. Machine learning improves EEG pathology classification.
problem Automating clinical EEG analysis using machine learning.
method Developed a comprehensive feature-based framework and compared it to deep neural networks.
result Feature-based framework achieves accuracies similar to deep neural networks.
Study agnostic feature-based dynamic pricing models with linear policies and noisy valuations.
problem Tackles dynamic pricing with unknown noise and no assumptions on data.
method Studies two agnostic models: linear policy and linear noisy valuation, presenting algorithms and regret bounds.
result Demonstrates no-regret learning is possible under weak assumptions, but noisy feedback is not significantly more useful than bandit feedback.
New model combines shape and feature-based measures for better time series classification.
problem Limited approaches in time series classification lead to poor results for some classes.
method Proposes a new model that automatically decides between shape and feature-based measures.
result Improves classification accuracy statistically significantly on real-world datasets.
A new method uses Gaussian Processes for feature-based nonrigid image registration.
problem Estimating dense displacement fields for nonrigid image registration.
method Using Gaussian Processes to estimate both dense displacement field and uncertainty map.
result GP-based interpolation performs similarly to state-of-the-art B-spline interpolation.
Unified metric c-Eval evaluates feature-based explanations by perturbation.
problem Lack of consensus on evaluating feature-based local explanations.
method Introduces c-Eval metric and framework to quantify explanation quality.
result c-Eval captures the importance of input features and is applicable in adversarial-robust models.
GRANITE unifies feature-based explanation methods to reduce disagreement.
problem Disagreement among feature-based explanation methods.
method GRANITE partitions feature space into regions minimizing interaction and distribution influences.
result Unified and consistent feature explanations.
In this paper we discuss policy iteration methods for approximate solution of a finite-state discounted Markov decision problem, with a focus on feature-based aggregation methods and their connection with deep reinforcement learning schemes. We introduce features of the states of the original problem, and we formulate …
The paper presents a method for analyzing shape graphs using specific features.
problem Analyzing geometric and topological variations in shape graphs.
method Curated set of topological, geometric, and directional features for shape graph analysis.
result The feature representation is effective for tasks like group comparison and classification.
Paper introduces new evaluation criteria for feature-based model explanations.
problem Establishing reliable feature importance explanations for models.
method Robustness analysis using smaller adversarial perturbations.
result New explanations that are necessary and sufficient for predictions.
Rating Prediction is a basic problem in Recommender System, and one of the most widely used method is Factorization Machines(FM). However, traditional matrix factorization methods fail to utilize the benefit of implicit feedback, which has been proved to be important in Rating Prediction problem. In this work, we consi…
Model explanations can leak sensitive training data information, posing privacy risks.
problem Privacy risks of model explanations that expose training data information.
method Membership inference attacks on feature-based model explanations.
result Backpropagation-based explanations reveal statistical information about decision boundaries, leaking training data membership.
The task of determining a speaker's native language based only on his speeches in a second language is known as Native Language Identification or NLI. Due to its increasing applications in various domains of speech signal processing, this has emerged as an important research area in recent times. In this paper we have …
Perceptual capabilities of artificial systems have come a long way since the advent of deep learning. These methods have proven to be effective, however they are not as efficient as their biological counterparts. Visual attention is a set of mechanisms that are employed in biological visual systems to ease computationa…
Paper introduces methods to integrate external knowledge into RNNs using attention mechanisms.
problem Incorporating external knowledge into RNNs for improved performance.
method Proposes three methods: attentional concatenation, feature-based gating, and affine transformation.
result Attentional feature-based gating consistently improves performance across tasks.
AeGAN improves speech clarity in noisy environments.
problem Improving speech recognition in crowded noisy environments.
method Generative adversarial networks (GAN) with a novel architecture.
result The proposed framework outperforms traditional and learning-based methods.
Domain adaptation has become a prominent problem setting in machine learning and related fields. This review asks the question: how can a classifier learn from a source domain and generalize to a target domain? We present a categorization of approaches, divided into, what we refer to as, sample-based, feature-based and…
A new method for dynamic feature selection outperforms existing approaches.
problem Sequentially selecting features based on current information in machine learning.
method Greedy selection of features based on conditional mutual information, combined with a learning approach for optimization.
result The method outperforms existing feature selection methods in experiments.
Capturing the dynamical properties of time series concisely as interpretable feature vectors can enable efficient clustering and classification for time-series applications across science and industry. Selecting an appropriate feature-based representation of time series for a given application can be achieved through s…
Improves machine learning models by incorporating physical laws into feature maps.
problem Lack of model interpretability in classical machine learning approaches.
method Physics-informed feature maps constructed from physical laws and dimensional analysis.
result Enhanced model interpretability and potential discovery of new physical equations.
Study shows increased precipitation variability in Paris area over years.
problem Evaluating the evolution of precipitation variability over time.
method Shape-based Dynamic Time Warping (IMS-DTW) for clustering rainfall time series.
result Precipitation variability increased in Paris area over years.
Energy-efficient detection of natural errors in deep networks.
problem Deep networks lack error detection capability without additional energy costs.
method Append RACs at hidden layers to detect natural errors with early classification termination.
result Early classification termination reduces energy consumption.
Micro-panel data are collected and analysed in many research and industry areas. Cluster analysis of micro-panel data is an unsupervised learning exploratory method identifying subgroup clusters in a data set which include homogeneous objects in terms of the development dynamics of monitored variables. The supply of cl…
To meet the standard of differential privacy, noise is usually added into the original data, which inevitably deteriorates the predicting performance of subsequent learning algorithms. In this paper, motivated by the success of improving predicting performance by ensemble learning, we propose to enhance privacy-preserv…
Paper introduces privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand.
problem Privacy-preserving inventory policy learning for feature-based newsvendor with unknown demand distribution and nonsmooth loss function.
method Developed a clipped noisy gradient descent algorithm based on convolution smoothing for optimal inventory estimation within f-differential privacy framework.
result Achieved privacy-preserving optimal inventory policy with provable privacy guarantees and desirable statistical precision.
User and item features of side information are crucial for accurate recommendation. However, the large number of feature dimensions, e.g., usually larger than 10^7, results in expensive storage and computational cost. This prohibits fast recommendation especially on mobile applications where the computational resource …
HRFA generates high-resolution, realistic adversarial examples for DNNs.
problem Revealing vulnerabilities of DNNs with imperceptible, semantic attacks.
method Modifies latent feature representation, backpropagating through generative model.
result Generates adversarial examples with up to 1024x1024 resolution, evading denoising defenses.
Automatically extracts features from time series data for improved forecasting.
problem Manual feature selection for time series forecasting is inefficient and prone to errors.
method Extracts features from time series using recurrence plots and computer vision algorithms.
result Automatically extracted features lead to highly comparable and sometimes superior forecasting performance.
Cold-start is a very common and still open problem in the Recommender Systems literature. Since cold start items do not have any interaction, collaborative algorithms are not applicable. One of the main strategies is to use pure or hybrid content-based approaches, which usually yield to lower recommendation quality tha…
Study shows safely discarding features based on aggregate SHAP values is sound.
problem Discarding features based on aggregate SHAP values without proper justification.
method Investigated the soundness of discarding features based on aggregate SHAP values, proposing to aggregate SHAP values over the extended support.
result A small aggregate SHAP value implies safely discarding the corresponding feature.
The paper compares clustering methods for improving time series forecasting accuracy.
problem Improving time series forecasting accuracy using neural networks.
method Investigates feature-based and distance-based clustering methods for time series forecasting.
result Feature-based clustering outperforms distance-based clustering in terms of speed and efficiency.
We propose a principled method for kernel learning, which relies on a Fourier-analytic characterization of translation-invariant or rotation-invariant kernels. Our method produces a sequence of feature maps, iteratively refining the SVM margin. We provide rigorous guarantees for optimality and generalization, interpret…
PCMC-Net uses neural networks to estimate transition rates in choice models, improving accuracy over traditional methods.
problem Inference limitations of traditional PCMC models when examples are scarce or new alternatives are observed.
method Amortized inference approach embedding PCMC definition into a neural network.
result Neural network outperforms feature engineered and machine learning models in airline booking prediction.
Herein, we generate pseudo-features based on the multivariate probability distributions obtained from the feature maps in layers of trained deep neural networks. Further, we augment the minor-class data based on these generated pseudo-features to overcome the imbalanced data problems. The proposed method, i.e., cavity …
Wind power prediction is of vital importance in wind power utilization. There have been a lot of researches based on the time series of the wind power or speed, but In fact, these time series cannot express the temporal and spatial changes of wind, which fundamentally hinders the advance of wind power prediction. In th…
mNARX+ creates accurate surrogate models for complex systems without requiring domain expertise.
problem Creating accurate surrogate models for complex dynamical systems without extensive domain knowledge.
method Data-driven, recursive algorithm that automatically selects temporal features and their causal ordering.
result Automatically identifies critical auxiliary quantities and their order for accurate modeling.
A new approach to newsvendor problems reduces loss by up to 40%.
problem Model misspecification in feature-based newsvendor problems.
method Conformal prediction framework combining selective training and calibration phases.
result Statistical guarantees and improved confidence intervals for critical quantiles.
OOD detection methods often misidentify OOD points, leading to ineffective safety improvements.
problem Improving model safety through OOD detection methods often leads to incorrect identification of out-of-distribution points.
method Re-examine popular OOD detection procedures based on predictive uncertainty or features of supervised models trained on in-distribution data.
result Popular OOD detection methods incorrectly conflate high uncertainty and far feature-space distance with being out-of-distribution.
Recent work on discriminative segmental models has shown that they can achieve competitive speech recognition performance, using features based on deep neural frame classifiers. However, segmental models can be more challenging to train than standard frame-based approaches. While some segmental models have been success…
Novel framework for spatio-temporal event analysis using Hawkes processes.
problem Inference of dynamics in spatio-temporal event sequences.
method Randomized Fourier feature-based transformations and gradient descent.
result Improved fitting capability in synthetic and real datasets.
FBSM improves item recommendation for cold-start users by modeling feature interactions.
problem Cold-start item recommendation for new users.
method Factorized bilinear similarity model learning interactions among item features.
result Improves TOP-n recommendation performance compared to traditional methods.
We describe a novel neural network architecture for the prediction of ventricular tachyarrhythmias. The model receives input features that capture the change in RR intervals and ectopic beats, along with features based on heart rate variability and frequency analysis. Patient age is also included as a trainable embeddi…
Link prediction requires predicting which new links are likely to appear in a graph. Being able to predict unseen links with good accuracy has important applications in several domains such as social media, security, transportation, and recommendation systems. A common approach is to use features based on the common ne…
Transformers predict price movements from limit order books.
problem Predicting price movements from limit order books.
method Causal convolutional network with masked self-attention.
result Significantly outperforms existing architectures on FI-2010 dataset.
Random feature maps are ubiquitous in modern statistical machine learning, where they generalize random projections by means of powerful, yet often difficult to analyze nonlinear operators. In this paper, we leverage the "concentration" phenomenon induced by random matrix theory to perform a spectral analysis on the Gr…