Domain adaptation aims to assist the modeling tasks of the target domain with knowledge of the source domain. The two domains often lie in different feature spaces due to diverse data collection methods, which leads to the more challenging task of heterogeneous domain adaptation (HDA). A core issue of HDA is how to pre…
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.
168,695 papers · 148 categories
Trend · papers per month
48 results for “information preservation”
Augmented bridge matching preserves coupling information between distributions.
problem Preserving the original empirical pairing in flow and bridge matching processes.
method Augmenting the velocity field with initial sample point information.
result Simple modification recovers coupling information without losing Markovian property.
Proposes a privacy-preserving recommendation system using matrix factorization and differential privacy.
problem Privacy leakage in recommendation systems when anonymizing user data is not sufficient.
method Uses matrix factorization and differential privacy via the Gaussian mechanism.
result Demonstrates excellent utility for privacy-preserving recommendation systems.
Network embedding is the process of learning low-dimensional representations for nodes in a network, while preserving node features. Existing studies only leverage network structure information and focus on preserving structural features. However, nodes in real-world networks often have a rich set of attributes providi…
Trimming the Independent Fat: Sufficient Statistics, Mutual Information, and Predictability from Effective Channel Statescond-mat.stat-mech
One of the most fundamental questions one can ask about a pair of random variables X and Y is the value of their mutual information. Unfortunately, this task is often stymied by the extremely large dimension of the variables. We might hope to replace each variable by a lower-dimensional representation that preserves th…
Text style transfer aims to modify the style of a sentence while keeping its content unchanged. Recent style transfer systems often fail to faithfully preserve the content after changing the style. This paper proposes a structured content preserving model that leverages linguistic information in the structured fine-gra…
Dimensionality reduction is an important operation in information visualization, feature extraction, clustering, regression, and classification, especially for processing noisy high dimensional data. However, most existing approaches preserve either the global or the local structure of the data, but not both. Approache…
We propose a data-driven framework for optimizing privacy-preserving data release mechanisms to attain the information-theoretically optimal tradeoff between minimizing distortion of useful data and concealing specific sensitive information. Our approach employs adversarially-trained neural networks to implement random…
VFGNN tackles privacy-preserving node classification with federated GNN.
problem Data isolation problem in graph data.
method Vertically partitioned federated GNN, differential privacy.
result Demonstrates effectiveness of VFGNN on three benchmarks.
Deep Learning techniques have achieved remarkable results in many domains. Often, training deep learning models requires large datasets, which may require sensitive information to be uploaded to the cloud to accelerate training. To adequately protect sensitive information, we propose distributed layer-partitioned train…
EPNE models evolving network patterns for better predictions.
problem Capturing evolving patterns in dynamic networks.
method EPNE models temporal network evolution using causal convolutions and a temporal objective function.
result EPNE outperforms other methods in various prediction tasks.
Binary autoencoder with sparse hidden layer preserves information and zero reconstruction error.
problem Preserving information and zero reconstruction error in binary neural networks.
method Binary autoencoder with random binary weights, sparse hidden layer, and varying neuron thresholds.
result Zero reconstruction error for any input with a large hidden layer and varying neuron thresholds.
Paper presents privacy-preserving techniques for HD computing.
problem Privacy loss in HD computing due to reversible computation.
method Quantization and pruning of hypervectors for differential privacy.
result Differentially private HD model for cloud inference.
Researchers found PP-GANs can hide sensitive data in sanitized images, undermining privacy checks.
problem Lack of formal proofs of privacy in PP-GANs for image sanitization.
method Subverted PP-GANs for facial expression recognition to hide sensitive data in sanitized images.
result It is possible to hide sensitive identification data in sanitized PP-GAN output images, even allowing reconstruction of entire input images.
Slow feature analysis (SFA) is an unsupervised-learning algorithm that extracts slowly varying features from a multi-dimensional time series. A supervised extension to SFA for classification and regression is graph-based SFA (GSFA). GSFA is based on the preservation of similarities, which are specified by a graph struc…
Paper develops privacy-preserving dynamic pricing policy for e-commerce.
problem Protecting customer privacy in dynamic pricing with personalized information.
method Uses differential privacy framework to develop a privacy-preserving policy.
result Achieves both privacy and performance guarantees in dynamic pricing.
While enormous progress has been made to Variational Autoencoder (VAE) in recent years, similar to other deep networks, VAE with deep networks suffers from the problem of degeneration, which seriously weakens the correlation between the input and the corresponding latent codes, deviating from the goal of the representa…
SASSL improves self-supervised learning by preserving image structure.
problem Distorted augmented samples in self-supervised learning.
method Neural Style Transfer to decouple semantic and stylistic attributes.
result Boosts ImageNet top-1 accuracy by up to 2 percentage points.
We present a method for feature interpretation that makes use of recent advances in autoregressive density estimation models to invert model representations. We train generative inversion models to express a distribution over input features conditioned on intermediate model representations. Insights into the invariance…
This paper tackles spatio-temporal information preservation in machine learning.
problem Conventional machine learning assumes orthogonal data attributes, disrupting spatio-temporal information.
method Shift-invariant k-means, convolutional dictionary learning, and spatio-temporal hypercomplex encoding schemes are proposed.
result Gabor feature extraction outperforms convolutional dictionary learning in spatio-temporal information preservation.
An adversarial learning framework for preserving users' anonymity in face-based emotion recognitioncs.LG
Image and video-capturing technologies have permeated our every-day life. Such technologies can continuously monitor individuals' expressions in real-life settings, affording us new insights into their emotional states and transitions, thus paving the way to novel well-being and healthcare applications. Yet, due to the…
New system preserves message meaning in wireless networks, improving data rate.
problem Efficiently transmitting message meaning in wireless networks.
method Modeling semantics as hidden random variables, using Information Bottleneck for compression.
result 20 dB SNR improvement for semantic communication.
Many reinforcement learning applications involve the use of data that is sensitive, such as medical records of patients or financial information. However, most current reinforcement learning methods can leak information contained within the (possibly sensitive) data on which they are trained. To address this problem, w…
With the proliferation of training data, distributed machine learning (DML) is becoming more competent for large-scale learning tasks. However, privacy concerns have to be given priority in DML, since training data may contain sensitive information of users. In this paper, we propose a privacy-preserving ADMM-based DML…
Estimates for VPMCF show ancient MCF solutions and finite-time behavior.
problem Volume Preserving Mean Curvature Flow (VPMCF) behavior and singularities.
method Nonlocal estimates and blowup analysis.
result Ancient solutions to MCF and finite-time behavior of VPMCF.
Data similarity is a key concept in many data-driven applications. Many algorithms are sensitive to similarity measures. To tackle this fundamental problem, automatically learning of similarity information from data via self-expression has been developed and successfully applied in various models, such as low-rank repr…
New method reduces spatial graphs while preserving their topological features.
problem Finding a smaller spatial graph with the same structure.
method Topological spatial graph coarsening approach based on triangle-aware graph filtration.
result Significant reduction in graph size while preserving topological information.
Missing data enhances privacy in differential privacy.
problem Privacy preservation in datasets with missing values.
method Formalized missing data as a privacy amplification mechanism within differential privacy.
result Incomplete data can yield privacy amplification for differentially private algorithms.
CIB compresses variables causally, preserving key causal interactions.
problem Constructing causal variable abstractions in complex systems.
method Causal Information Bottleneck (CIB) method, extending IB to include causal structures.
result CIB produces causally interpretable abstractions that accurately capture causal relations.
Cloak identifies essential features to preserve prediction privacy without provider collaboration.
problem Discovering the subset of features necessary for a prediction task.
method Gradient-based perturbation maximization method to identify essential features, followed by suppression of the rest using utility-preserving constant values.
result Cloak reduces mutual information between input and sifted representations by 85.01% with negligible utility loss.
New algorithms improve privacy-preserving data release using external predictions.
problem Privacy-preserving data release with improved utility using external information.
method Learning-augmented algorithms for multiple quantile release.
result Error guarantees scale with prediction quality, almost recovering state-of-the-art guarantees.
Feature selection, which searches for the most representative features in observed data, is critical for health data analysis. Unlike feature extraction, such as PCA and autoencoder based methods, feature selection preserves interpretability, meaning that the selected features provide direct information about certain h…
APGE protects graph node representations from inference attacks.
problem Privacy leakage in graph embedding methods.
method Adversarial training framework with disentangling and purging mechanisms.
result APGE preserves structural and utility attributes while concealing private information.
We propose a new method for embedding graphs while preserving directed edge information. Learning such continuous-space vector representations (or embeddings) of nodes in a graph is an important first step for using network information (from social networks, user-item graphs, knowledge bases, etc.) in many machine lear…
The use of inverse probability weighting (IPW) methods to estimate the causal effect of treatments from observational studies is widespread in econometrics, medicine and social sciences. Although these studies often involve sensitive information, thus far there has been no work on privacy-preserving IPW methods. We add…
Develops privacy-preserving methods for equivalence testing in healthcare.
problem Protecting patient data in healthcare studies.
method Differential privacy techniques for simulation-based calibration.
result Maintains type-I error control and comparable power to non-private methods.
Adaptive truncation improves privacy in online Bayesian estimation.
problem Ensuring privacy in online Bayesian estimation of a static parameter.
method Sequential Monte Carlo, adaptive truncation, Thompson sampling.
result Adaptive truncation reduces privacy-preserving noise, enabling more accurate estimation.
Secure XGB for privacy-preserving machine learning in federated learning.
problem Privacy-preserving machine learning in federated learning with practical gradient tree boosting models.
method Secure multi-party computation, distributed model storage, secure permutation protocols.
result Our XGB models provide competitive accuracy and practical performance.
Warped product affects divergences in information geometry.
problem Warped product's impact on divergences in information geometry.
method Study of warped product on information geometry.
result Warped product does not preserve canonical divergences.
SAttention improves long sequence attention with smoothed skeleton sketching.
problem Quadratic complexity of vanilla Attention makes it unsuitable for long sequence tasks.
method SAttention uses smoothing and matrix sketching to balance information preservation and computation.
result SAttention significantly outperforms vanilla Attention and other Attention variants.
Summarizing large-scaled directed graphs into small-scale representations is a useful but less studied problem setting. Conventional clustering approaches, which based on "Min-Cut"-style criteria, compress both the vertices and edges of the graph into the communities, that lead to a loss of directed edge information. O…
Graph neural networks (GNNs) have shown great power in learning on attributed graphs. However, it is still a challenge for GNNs to utilize information faraway from the source node. Moreover, general GNNs require graph attributes as input, so they cannot be appled to plain graphs. In the paper, we propose new models nam…
Estimates latent dimensionality for prediction tasks using mutual information.
problem Estimating the latent dimensionality needed for accurate prediction.
method Formulates the problem as an Information Bottleneck question and uses neural mutual information estimators with a hybrid critic to preserve latent geometry.
result The hybrid critic method provides a more accurate estimation of task-relevant dimensionality.
Combines OT and PCA for DR, preserving clusters.
problem Analyzing high-dimensional data with global dependencies.
method Optimal transport (OT) for minimizing reconstruction error, combined with PCA.
result Effective preservation of high-dimensional clusters in embeddings.
Powered by machine learning services in the cloud, numerous learning-driven mobile applications are gaining popularity in the market. As deep learning tasks are mostly computation-intensive, it has become a trend to process raw data on devices and send the deep neural network (DNN) features to the cloud, where the feat…
In network embedding, random walks play a fundamental role in preserving network structures. However, random walk based embedding methods have two limitations. First, random walk methods are fragile when the sampling frequency or the number of node sequences changes. Second, in disequilibrium networks such as highly bi…
Multi-task learning (MTL) refers to the paradigm of learning multiple related tasks together. In contrast, in single-task learning (STL) each individual task is learned independently. MTL often leads to better trained models because they can leverage the commonalities among related tasks. However, because MTL algorithm…
Privacy-preserving crypto exchanges adjust prices based on Gaussian noise.
problem Ensuring fair pricing in privacy-preserving cryptocurrency exchanges.
method Derive Kyle equilibrium with Gaussian noise perturbation, rescaling price-impact and strategy factors.
result Identify a privacy subsidy as a transfer from LP pool to traders, invariant to noise.