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.
Survey and new methods for feature-based aggregation in reinforcement learning.
problem Solving finite-state discounted Markov decision problems with feature-based aggregation.
method Feature construction and aggregation, combined with deep neural networks for policy improvement.
result Approximate policy iteration can be more effective when using nonlinear function of features.
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.
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.
ExGate improves neural network accuracy with feature-based attention.
problem Efficiency and accuracy in artificial neural networks for feature-based attention.
method Externally controlled neuron gating in artificial neural networks.
result 5% increase in classification accuracy on CIFAR-10 dataset.
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.
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.
This review categorizes domain adaptation methods without target labels.
problem How to train a classifier from a source domain to generalize to a target domain.
method Sample-based, feature-based, and inference-based methods.
result Recurring ideas and conditions for cross-domain generalization error.
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…
A novel clustering method for micro-panel data improves efficiency and accuracy.
problem Insufficient clustering methods for micro-panel data.
method Feature-based two-step approach for identifying homogeneous clusters.
result The CluMP method outperforms existing methods in clustering micro-panel data.
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.
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.
Identifies learning rules from neural network observables.
problem Determine the underlying plasticity rules governing learning in biological systems.
method Simulated idealized neuroscience experiments with artificial neural networks to generate a dataset of learning trajectories. Used linear and non-linear classifiers to identify learning rules from aggregate statistics of weights, activations, and activity changes.
result Different classes of learning rules can be separated solely on the basis of aggregate statistics of the weights, activations, or instantaneous layer-wise activity changes.
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.
GCN-LASE incorporates link attributes in graph convolutional networks.
problem Ignoring link attributes in GCNs limits their performance.
method Proposes GCN-LASE, incorporating both node and link attributes, using tensor product of link attributes as neighbor features, and estimating feature sums through Monte Carlo sampling.
result GCN-LASE outperforms strong baselines on various graph datasets.
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.
Paper proposes i-vector approach for NLI with improved accuracy.
problem Identifying a speaker's native language from speech in a second language.
method i-vector approach using MFCC and GFCC features.
result Improved accuracy in NLI system, especially with GFCC features.
HSSE framework embeds single-cell RNA-seq data at multiple scales.
problem Capturing heterogeneous local structure in single-cell RNA-seq data.
method Hierarchical sheaf spectral embedding (HSSE) framework.
result HSSE achieves competitive or improved performance in single-cell RNA-seq data representation learning.
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.
Deep CNN architectures improve neonatal seizure detection accuracy.
problem Improving EEG-based neonatal seizure detection accuracy.
method Design and test of deep convolutional networks of varying depths compared to a shallow SVM-based detector.
result A deep 11-layer CNN architecture significantly outperforms shallow architectures, improving AUC90 from 82.6% to 86.8%.
Catch22 reduces time series feature space to 22 canonical characteristics for efficient analysis.
problem Efficiently capturing and comparing time series properties for diverse applications.
method Inference of minimal sets of time-series features from a comprehensive library.
result Catch22 (22 canonical characteristics) reduces computation time and complexity.
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.
flacco simplifies feature-based landscape analysis for optimization problems.
problem Choosing the best optimizer from a portfolio of algorithms.
method Developed an R-package for feature-based landscape analysis.
result Makes landscape analysis accessible and comprehensible.
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.
Enhances privacy-preserving logistic regression for diabetes prediction.
problem Maintaining privacy while improving prediction accuracy in machine learning.
method Proposes stacking to enhance privacy-preserving logistic regression, either sample-based or feature-based.
result Feature-based partitioning requires fewer samples than sample-based, potentially offering better performance.
DFM binarizes feature embeddings for fast, accurate recommendation.
problem Expensive storage and computational cost due to large feature dimensions.
method DFM binarizes real-valued model parameters into binary codes for efficient storage and computation.
result DFM outperforms state-of-the-art binarized recommendation models and shows competitive performance compared to its real-valued version.
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.
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.
Proposes a new feature-based evaluation method for explaining Deep Learning models in text classification.
problem Lack of consideration for linguistic dependencies in existing attribution-based explanations.
method Investigates perturbations based on embedded features removal from intermediate layers of Convolutional Neural Networks.
result Visualization tool assists analysts in understanding model predictions better.
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.
Proposes a new optimization-based method for aggregating sets in neural networks.
problem Limited representational power of existing aggregation methods.
method Equilibrium Aggregation: an optimization-based approach.
result Equilibrium Aggregation outperforms existing methods in various tasks.
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.
Turbo-Aggregate reduces secure aggregation time from quadratic to nearly linear.
problem Quadratic overhead in secure model aggregation for federated learning.
method Multi-group circular strategy, additive secret sharing, and coding techniques.
result Achieves O(NlogN) overhead, compared to O(N2), for up to 50% user dropout. Proposes a new graph-based model for cold-start recommendations.
problem Cold-start problem in Recommender Systems, especially for items with no interaction history.
method Graph-based feature weighting model using probabilities from item-based collaborative filtering.
result Shows improved recommendation quality compared to existing methods.
Non-linear filter aggregation improves image denoising.
problem Efficiently denoise images with complex noise patterns.
method Non-linear aggregation of preliminary filters using a new proximity metric.
result The aggregated filters outperform individual filters in denoising.
This work examines aggregation functions in Deep Set learning.
problem The sensitivity of Deep Set networks to aggregation function choices.
method Investigation of alternative aggregation functions, including learnable recurrent ones.
result Learnable aggregations improve performance, reduce hyper-parameter sensitivity, and generalize better.
Aggregator learns optimal forecast aggregation in partial evidence environments.
problem Forecast aggregation in repeated binary event settings with expert forecasts.
method Bayesian experts with partial evidence, aggregator learns optimal aggregation.
result Optimal aggregation can be learned in polynomial time for a wide range of partial evidence environments.
Study aggregation of statistical evidence under unknown dependence using group-invariance.
problem Aggregating statistical evidence under unknown and complex dependence structures.
method Develops a framework using group-invariance and permutation-based constructions to aggregate evidence across transformed datasets.
result Shows uniform improvement in critical values for single-batch aggregation over deterministic calibrations, adapting to unknown dependence structures.