While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortunately, do not scale well. To overcome this limitation, we present hash graph kernels, a general framework to derive kernels for graphs with…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,181 papers · 148 categories
Trend · papers per month
48 results for “Continuous Attributes”
Enhances SBM with continuous attributes for better network analysis.
problem Community detection in networks with multiple continuous attributes.
method Augmented stochastic block model with multivariate Gaussian parameters.
result Satisfactory performance in link prediction and collaborative filtering tasks.
Paper proposes a new FRL algorithm for continuous sensitive attributes using EIPM.
problem Existing FRL algorithms cannot handle continuous sensitive attributes.
method Introduces EIPM to assess fairness in representation space for continuous attributes and proposes FREM algorithm.
result FREM outperforms other methods in fairness evaluation for continuous sensitive attributes.
Meta-Learned Attribute Self-Interaction Network for Continual and Generalized Zero-Shot Learningcs.CV
MAIN network learns attributes without unseen class attributes for faster, more adaptable ZSL.
problem Learning unseen categories without known attributes and handling continual learning.
method Meta-learning attribute self-interaction network with inverse regularization.
result Main network outperforms state-of-the-art ZSL methods without unseen class attributes.
GLSR-VAE enhances VAE latent space for better attribute control.
problem Fine-tuning VAE latent space for continuous data attributes.
method Geodesic Latent Space Regularization (GLSR) for VAEs.
result Controls latent space changes to reflect data attributes.
New method optimizes fairness in predictive models for continuous sensitive attributes.
problem Enforcing full statistical independence on continuous sensitive attributes is too restrictive.
method Functional bilevel optimization (FBO) and ITD algorithms.
result Achieves lowest or near-lowest fairness-accuracy regret on synthetic and real datasets.
New framework for fairness in continuous protected attributes.
problem Inherited biases in AI predictions with continuous protected attributes.
method Formalizes SP and PP through path-specific partial derivatives, introduces a fair tuning algorithm.
result Existence and construction of fair predictors that satisfy SP along not-allowed paths and PP along allowed paths.
Faster ZSL with continual learning and self-gating.
problem Generalizing models to unseen categories and handling sequential data.
method Meta-continual zero-shot learning (MCZSL) with self-gating and scaled class normalization.
result Outperforms state-of-the-art results with faster training ().
Generative Adversarial Networks generate realistic network traffic data.
problem Generating realistic flow-based network traffic for evaluation of NIDS.
method Generative Adversarial Networks (GANs) with preprocessing for categorical attributes.
result Two of three preprocessing methods generate high quality flow-based network traffic.
New method makes neural network explanations more robust to attacks.
problem Vulnerability of feature attributions to adversarial attacks.
method Promotes Lipschitz continuity and smoothness in DNNs to improve robustness.
result Regularization and stochastic smoothing methods enhance attribution robustness.
A new method for disentangled latent spaces in VAEs that can manipulate attributes.
problem Disentangled representation of attributes in latent spaces of VAEs.
method Attribute-based regularization loss to enforce monotonic relationships between attributes and latent codes.
result Manipulation of attributes in latent spaces post-training.
Proposes adversarial learning for counterfactual fairness in machine learning.
problem Ensuring fairness at the individual level by simulating counterfactual samples.
method Adversarial neural learning approach to infer counterfactual samples.
result Significant improvements in counterfactual fairness for both discrete and continuous settings.
A new graph kernel uses Wasserstein distance for better graph comparison.
problem Graph kernels often discard valuable information and struggle with continuous attributes.
method Proposes a novel graph kernel using Wasserstein distance for node feature vector distributions.
result Improves prediction performance on graph classification tasks.
SLOGAN improves GANs' conditional generation by balancing latent attribute distributions.
problem Imbalanced latent attribute distributions in GANs.
method Stein latent optimization with a Gaussian mixture prior and contrastive loss.
result SLOGAN achieves state-of-the-art unsupervised conditional generation performance.
Introduces FairCOCCO for fair learning with multitype, multivariate sensitive attributes.
problem Fairness in machine learning with multiple, complex sensitive attributes.
method FairCOCCO measure based on cross-covariance operators, incorporating a regularisation term.
result Consistent improvements in balancing fairness and predictive power on real-world datasets.
A simple data discretization method improves classifier performance.
problem Machine learning classifiers struggle with continuous attributes.
method Supervised discretization approach to maximize accuracy while minimizing loss of information.
result The modified approach outperforms MIL and MDLP in several cases.
Proposes a block-based model for attributed network embedding.
problem Handles both assortative and disassortative networks.
method Assigns nodes to blocks based on similar linkage patterns, using neural networks to preserve attribute information.
result Consistently outperforms state-of-the-art methods on disassortative networks.
Machine Learning with Multitype Protected Attributes: Intersectional Fairness through Regularisationcs.LG
Proposes a new method for fairness in machine learning with multiple protected attributes.
problem Ensuring fairness in machine learning models with continuous and multiple protected attributes.
method Distance covariance regularisation framework to mitigate association between model predictions and protected attributes.
result Demonstrates effectiveness in mitigating fairness gerrymandering in regression tasks.
Rotation forest is superior to other classifiers for problems with continuous features.
problem Classifying problems with real-valued features.
method Empirical comparison of classifiers from three families: SVM, tree-based ensembles, and neural networks.
result Rotation forest is significantly more accurate than competing techniques on average.
New findings show local attributions can't be both robust and provide recourse.
problem Ensuring machine learning systems are accountable and provide actionable recourse options.
method Formal definition of recourse sensitivity and counterexamples for popular attribution methods.
result It is impossible for any single attribution method to be both robust and provide recourse.
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.
SX-GeoTree improves spatially coherent explanations in geospatial regression trees.
problem Capturing spatial dependence and producing robust explanations in tabular prediction models.
method Integrates three objectives: impurity reduction, spatial residual control, and explanation robustness via modularity maximization on a consensus similarity network.
result Improves residual spatial evenness and doubles attribution consensus (modularity: Fujian 0.19 vs 0.09; Seattle 0.10 vs 0.05).
Extends fair empirical risk minimization to continuous sensitive attributes.
problem Avoiding unfair influence of sensitive information in regression.
method Generalized fair empirical risk minimization framework for continuous sensitive attributes.
result Derives learning guarantees for statistical consistency in risk and fairness.
A coloring scheme improves graph neural networks for node disambiguation.
problem Improving graph neural networks' ability to distinguish identical node attributes.
method Introducing a graph neural network called Colored Local Iterative Procedure (CLIP) that uses colors to disambiguate node attributes.
result CLIP is a universal approximator of continuous functions on graphs with node attributes.
WassersteinGrad improves weather forecasting explanations by addressing geometric misalignment issues.
problem Improving explainability of autoregressive neural predictions on dynamic physical fields.
method WassersteinGrad, a geometric consensus method for averaged perturbed attribution maps.
result WassersteinGrad provides more accurate explanations for weather forecasting models.
Paper proposes an online learning algorithm for a neuro-fuzzy classifier with mixed data.
problem Inability of GFMMNN learning algorithms to handle mixed-attribute data.
method Extended online learning algorithm for GFMMNN that can handle both continuous and categorical features.
result Superior and stable classification performance compared to other learning algorithms.
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.
Unified framework for linear attribution methods in deep learning.
problem Separate theoretical foundations of XAI attribution methods.
method GRALIS (Gradient-Riesz Averaged Locally-Integrated Shapley) framework.
result Unified representation theory for linear attribution methods.
This article is a continuation of work on construction and calculation various of modifications of invariant based on the use Euclidean metric values attributed to elements of manifold triangulation. We again address the well investigated lens spaces as a standard tool for checking the nontriviality of topological inva…
TG-GAN models dynamic graph evolution for continuous-time temporal graphs.
problem Challenges in modeling dynamic temporal graphs, especially in continuous time.
method Temporal Graph Generative Adversarial Network (TG-GAN) that models truncated edge sequences, time budgets, and node attributes.
result TG-GAN significantly outperforms existing methods in efficiency and effectiveness.
Music FaderNets learns high-level musical qualities from low-level attributes.
problem Learning high-level musical qualities from limited data and subjective labels.
method Model low-level attributes through feature disentanglement and latent regularization; infer high-level features from low-level representations using GM-VAEs.
result Model successfully learns intrinsic relationships between high-level features and low-level attributes with minimal labeled data.
Machine learning enhances wireless network authentication for diverse devices.
problem Complex dynamic wireless environments challenge conventional authentication methods.
method Intelligent authentication using machine learning for diverse physical layer attributes.
result Machine learning-based authentication provides cost-effective, reliable, and situation-aware security.
The paper tackles fairness in supervised learning using information theory.
problem Discrimination in decision rules derived from biased historical data.
method Information theoretic framework for designing fair predictors, using equalized odds criterion.
result Designing predictors that are independent of a sensitive attribute while generalizing well.
New fairness criterion for risk-sensitive decisions in regulated industries.
problem Ensuring equitable outcomes in risk-sensitive decision-making.
method Marginal fairness for generalized distortion risk measures, two-step decision-making process.
result Ensures fairness in decision-making under risk measures, regardless of protected attributes.
Latent feature modeling allows capturing the latent structure responsible for generating the observed properties of a set of objects. It is often used to make predictions either for new values of interest or missing information in the original data, as well as to perform data exploratory analysis. However, although the…
This paper analyzes SHAP values using Fourier expansions for model interpretability.
problem Understanding and interpreting SHAP values in complex models.
method Developed a spectral framework using Fourier expansions for SHAP values in various model regimes.
result SHAP values are Lipschitz continuous in the deterministic regime and converge to Gaussian process values in the probabilistic regime.
New pricing model identifies and values different generator attributes.
problem Traditional hourly scheduling ignores time continuity and inter-temporal constraints.
method Continuous time commodity model with spot pricing and load duration models.
result Load duration pricing reduces total electricity purchasing cost and distributes profits more equitably.
New method shows data-driven causal studies can be misleading.
problem Misattribution of causality in data-driven earth science studies.
method Subsample-based ensemble approach for robust causality analysis.
result Transfer entropy-based causal graphs can be spurious.
Paper proposes a method to detect fair communities in graphs considering demographic attributes.
problem Inconsistent community detection violates fairness constraints for nodes with demographic attributes.
method Develops an -regularized pseudo-likelihood approach for fair graphical model selection.
result The method ensures demographic groups are fairly represented within detected communities.
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.
Develops fair decision trees for improved accuracy and fairness.
problem Lack of fairness in machine learning algorithms.
method Regularized tree induction to build fair decision trees.
result Fair Forest retains benefits of tree-based approach and improves accuracy and fairness.
Bayesian model for analyzing mixed data types.
problem Automatic exploratory analysis of heterogeneous datasets.
method General Bayesian non-parametric latent feature model.
result Automatic inference of model complexity and binary-valued latent features.
Deep Fair Learning: A Unified Framework for Fine-tuning Representations with Sufficient Networksstat.ML
Unified framework for fair representation learning in machine learning.
problem Ensuring fairness in machine learning models, especially when biased data representations lead to unfair predictions.
method Integrates nonlinear sufficient dimension reduction with deep learning to construct fair and informative representations, introducing a penalty term to enforce conditional independence between sensitive attributes and learned representations.
result Achieves a superior balance between fairness and utility, significantly outperforming state-of-the-art baselines on various data structures.
SAM adds semantic attributes to language models for better interpretation and style variation.
problem Improving text interpretation and style variation in language models.
method SAM includes document attributes, scores them, and embeds them into the model's input space.
result SAM generates interpretable texts and shows superior performance on various datasets.
In one dimension, the theory of the -normal distribution is well-developed, and many results from the classical setting have a nonlinear counterpart. Significant challenges remain in multiple dimensions, and some of what has already been discovered is quite nonintuitive. By answering several classically-inspired que…
The paper introduces fair regression methods to predict real-valued outcomes while ensuring fairness.
problem Predicting real-valued outcomes while ensuring fairness with respect to protected attributes.
method Proposes schemes for fair regression under statistical parity and bounded group loss, applicable to various losses.
result The schemes provide theoretical guarantees on the optimality and fairness of the obtained solutions.
Graph Beta Diffusion (GBD) generates graphs with mixed discrete and continuous components.
problem Generating graphs with mixed discrete and continuous components.
method Introduces Graph Beta Diffusion (GBD) using a beta diffusion process.
result Competes strongly with existing models across graph benchmarks.
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.