New method for private learning with public features improves convergence rates.
problem Private estimation with public features under local differential privacy.
method Semi-feature LDP, HistOfTree estimator.
result HistOfTree reaches mini-max optimal convergence rate.
New private learning algorithms improve utility in tasks with public features.
problem Private learning with public features in recommendation and ad prediction.
method Developed algorithms that protect only certain sufficient statistics, improving utility for linear regression and private recommendation benchmarks.
result Achieved state-of-the-art performance on private recommendation benchmarks.
Study shows how missing data from certain groups can unfairly bias risk models.
problem Data missingness without indicators of missingness can unfairly bias risk models.
method Developed an analytically tractable model of differential feature under-reporting and proposed new methods to mitigate bias.
result Under-reporting typically leads to increasing disparities in risk models.
PILLAR improves SP learning with less private data.
problem Efficiently learning with semi-private data under privacy constraints.
method Uses pre-trained public data features to reduce private data requirements.
result Significantly lower private labelled sample complexity achieved.
The aim of the present article is to treat the Greek public debt issue strictly as a curve fitting problem. Thus, based on Eurostat data and using the Mathematica technical computing software, an exponential function that best fits the data is determined modelling how the Greek public debt expands with time. Exploring …
The paper examines how NFT valuations correlate with market data and social trends.
problem Predicting NFT valuations based on market data and social trends.
method Utilizes public market data, NFT metadata, and social trends data; employs linear regression and recurrent neural networks.
result Identifies correlations between NFT valuations and various features.
Public pretraining improves private model training even in extreme distribution shift scenarios.
problem Improving private model training accuracy in settings with large distribution shift.
method Empirical evaluation and theoretical explanation of public representations improving private training accuracy.
result Public representations can improve private training accuracy by up to 67% over private training from scratch in settings with large distribution shift.
The paper proposes to analyze a data set of Finnish ranks of academic publication channels with Extreme Learning Machine (ELM). The purpose is to introduce and test recently proposed ELM-based mislabel detection approach with a rich set of features characterizing a publication channel. We will compare the architecture,…
Private learning needs more data or better features.
problem Improving differentially private machine learning performance.
method Demonstrates the need for either more private data or better features.
result Private learning requires either more data or better features.
Improved image generation with private data using perceptual features.
problem Difficulty in training generative models with differential privacy.
method Use pre-trained perceptual features to learn private data distribution.
result Generative models can generate high-quality images with low privacy budget (ϵ≈2). Study shows diverse data types improve SARS-COV-2 case surge predictions.
problem Improving pandemic case surge predictions using multimodal data.
method Investigated the effectiveness of biological, public health, and behavioral features.
result Diverse feature sets enhance prediction accuracy, varying by country and phase.
PriRec preserves privacy in POI recommendation by keeping data and models on users' devices.
problem Privacy concerns in centralized POI recommendation models.
method Local differential privacy for sensitive data, secure decentralized gradient descent for linear models, secure aggregation for feature interactions.
result PriRec achieves comparable or better recommendation accuracy than FM while protecting user privacy.
Author name disambiguation in bibliographic databases is the problem of grouping together scientific publications written by the same person, accounting for potential homonyms and/or synonyms. Among solutions to this problem, digital libraries are increasingly offering tools for authors to manually curate their publica…
A new framework for optimizing interventions with limited data.
problem Small data, default intervention data, unmodeled objectives, unforeseen consequences.
method Bandit data-driven optimization combining online bandit learning and offline predictive analytics.
result PROOF algorithm achieves no-regret and superior performance in simulations and real-world application.
MLS improves feature selection for imbalanced data.
problem Machine learning challenges with imbalanced high-dimensional data.
method Introduces Marginal Laplacian Score (MLS) for better feature selection.
result MLS improves performance on synthetic and public datasets.
Representation learning, especially which by using deep learning, has been widely applied in classification. However, how to use limited size of labeled data to achieve good classification performance with deep neural network, and how can the learned features further improve classification remain indefinite. In this pa…
Before any publication, data analysis of high-energy physics experiments must be validated. This validation is granted only if a perfect understanding of the data and the analysis process is demonstrated. Therefore, physicists prefer using transparent machine learning algorithms whose performances highly rely on the su…
Private estimation with public data reduces sample complexity.
problem Estimating private distributions with limited public data.
method Differentially private estimation with public data under constraints of pure or concentrated DP.
result Public data can significantly reduce private sample complexity for estimation.
Study public-data assisted private stochastic optimization with labeled or unlabeled public data.
problem Limits and capability of public-data assisted differentially private (PA-DP) algorithms in stochastic convex optimization.
method Lower bounds for PA-DP mean estimation and novel methods for leveraging public data in private supervised learning.
result Achieved dimension independent rate for GLM with unlabeled public data, showing optimality.
In this work a new way to calculate the multivariate joint entropy is presented. This measure is the basis for a fast information-theoretic based evaluation of gene relevance in a Microarray Gene Expression data context. Its low complexity is based on the reuse of previous computations to calculate current feature rele…
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…
In this paper, we study the problem of estimating smooth Generalized Linear Models (GLMs) in the Non-interactive Local Differential Privacy (NLDP) model. Different from its classical setting, our model allows the server to access some additional public but unlabeled data. In the first part of the paper we focus on GLMs…
Optimal DP model training with public data improves privacy and accuracy.
problem Ensuring privacy while training models with public data.
method Proves optimal error rates for DP model training with public data, develops novel algorithms.
result Optimal error rates can be achieved by using public data or optimal DP algorithms.
Model precision in a classification task is highly dependent on the feature space that is used to train the model. Moreover, whether the features are sequential or static will dictate which classification method can be applied as most of the machine learning algorithms are designed to deal with either one or another ty…
Efficiently learns private models using public data.
problem Improving private learning performance with public data.
method Proves computationally efficient algorithms for private learning with public data.
result First computationally efficient algorithms for private learning with public data.
Develops ELBD for efficient feature selection in VAE latent variables.
problem Feature selection in latent variables of VAE and its variants.
method ELBD score algorithm and weak convergence approximation for optimization.
result Effective feature selection and optimization of VAE models.
Feature extraction is a very crucial task in image and pixel (voxel) classification and regression in biomedical image modeling. In this work we present a machine learning based feature extraction scheme based on inception models for pixel classification tasks. We extract features under multi-scale and multi-layer sche…
Motivation: Biomarker discovery from high-dimensional data is a crucial problem with enormous applications in biology and medicine. It is also extremely challenging from a statistical viewpoint, but surprisingly few studies have investigated the relative strengths and weaknesses of the plethora of existing feature sele…
Study on InstaHide's security, linking to phase retrieval problem.
problem Security of InstaHide scheme for private dataset sharing.
method Design of a provable algorithm for private vector recovery.
result Private vectors can be recovered using synthetic vectors and public vectors.
Traditionally, machine learning algorithms rely on the assumption that all features of a given dataset are available for free. However, there are many concerns such as monetary data collection costs, patient discomfort in medical procedures, and privacy impacts of data collection that require careful consideration in a…
Study predicts coastal water quality using machine learning, identifying salinity as key factor.
problem Predicting and managing coastal water quality for public health and tourism.
method Machine learning models (Catboost, Xgboost, Random Forests, Support Vector Regression, Artificial Neural Networks) trained on environmental data.
result Catboost algorithm performed best, with R² values of 0.71 and 0.68 for E. Coli and enterococci predictions.
We consider learning problems where the training set consists of two types of examples: private and public. The goal is to design a learning algorithm that satisfies differential privacy only with respect to the private examples. This setting interpolates between private learning (where all examples are private) and cl…
Publicly pretraining models on Web data may undermine differential privacy.
problem The use of large Web-scraped datasets in differential privacy models.
method Critical review of leveraging pretrained models on public datasets for differential privacy.
result Publicizing pretrained models as 'private' could harm trust and generalize poorly.
Guided adaptive shrinkage uses co-data to improve feature selection in genomic studies.
problem Feature selection challenges in high-dimensional genomics data, especially in clinical settings.
method Guided adaptive shrinkage methods that use co-data to adapt shrinkage parameters.
result Improves feature selection in genomic studies, demonstrated through comparisons and examples.
Automatic summarisation is a popular approach to reduce a document to its main arguments. Recent research in the area has focused on neural approaches to summarisation, which can be very data-hungry. However, few large datasets exist and none for the traditionally popular domain of scientific publications, which opens …
Private distribution learning with public data, leveraging sample compression schemes.
problem Private distribution learning with public and private samples under differential privacy constraints.
method Connection to sample compression schemes and list learning.
result At least d public samples are necessary for private learnability of Gaussians in R^d.
Study detects unlawful insider trading using SHAP and CF, identifying key features.
problem Detecting and explaining unlawful insider trading with MNPI.
method Combining Shapley Values and Causal Forest approaches.
result Identifies key features explaining unlawful insider trading.
New method uses public data to achieve optimal nonparametric classification with privacy constraints.
problem Optimal nonparametric classification under local differential privacy constraints.
method Locally differentially private classification tree with data-driven pruning.
result Achieves mini-max optimal convergence rate with public data.
Algorithm selects public datasets for private machine learning.
problem Choosing the most suitable public dataset for private machine learning.
method Measures gradient subspace distance between public and private datasets.
result Excess risk scales with the subspace distance between gradients.
DNN2LR bridges DNN power and LR interpretability.
problem Combining DNN power and LR interpretability for real-world tabular data.
method Automatic feature crossing method based on DNN interpretation inconsistencies.
result DNN2LR outperforms complex DNN models and feature crossing methods.
Paper uses topological data analysis for time series classification.
problem Classifying univariate time series data, especially physiological signals.
method Persistent homology for feature engineering, followed by machine learning.
result Higher accuracy achieved with fewer features compared to traditional methods.
Proposes on-the-fly joint feature selection and classification for time-sensitive decisions.
problem Online feature selection and classification for time-sensitive decision making.
method Proposes a framework for joint feature selection and classification on-the-fly, optimizing feature usage and classification accuracy.
result Demonstrates superior performance over state-of-the-art methods on various datasets.
Improves zeroth-order optimization for private machine learning with public data.
problem High computation and memory cost of first-order DP methods.
method PAZO (Public Data Assisted Zeroth-order Optimization) framework.
result Achieves superior privacy/utility tradeoffs across tasks.
In this work, we utilize T1-weighted MR images and StackNet to predict fluid intelligence in adolescents. Our framework includes feature extraction, feature normalization, feature denoising, feature selection, training a StackNet, and predicting fluid intelligence. The extracted feature is the distribution of different…
This paper reviews statistical and machine learning methods for anti-money laundering.
problem Lack of scientific literature on statistical and machine learning methods for anti-money laundering.
method Client risk profiling and suspicious behavior flagging.
result Client risk profiling involves diagnostics, while suspicious behavior flagging involves non-disclosed features and hand-crafted risk indices.
Study private query release with public data, reducing sample sizes.
problem Answering a wide range of statistical queries while maintaining privacy.
method Combines public and private samples to answer queries with differential privacy.
result Private and public sample complexities for different query classes.
PMT uses public data moments to make DP feasible for unbounded data.
problem Applying differential privacy to unbounded data distributions.
method Public-moment-guided Truncation (PMT) using second-moments from public data.
result PMT improves the accuracy and stability of DP models.
Combines public and private data for better statistical estimation.
problem Estimating aggregate statistics from mixed data with varying privacy needs.
method Mixed estimators optimized for minimizing variance or median, using differential privacy techniques.
result Our mechanisms often outperform baseline methods in empirical tests.