Gaussian DP improves reporting of ML algorithms' differential privacy guarantees.
problem Incomplete and misleading DP guarantees for ML algorithms.
method Using non-asymptotic Gaussian Differential Privacy (GDP) to provide accurate bounds on privacy profiles of ML algorithms.
result GDP captures the entire privacy profile of DP-SGD and related algorithms with virtually no error.
New privacy model improves data analysis utility.
problem Poor privacy-utility tradeoff in local differential privacy.
method Profile-based privacy, leveraging graph of data distributions.
result Achieves higher utility than local differential privacy.
Paper improves privacy amplification by subsampling with a general method.
problem Ensuring privacy guarantees with subsampled data.
method General method leveraging divergence characterization of differential privacy.
result Recovery and improvement of prior analyses, derivation of lower bounds, and new instances.
Principled mapping from pure-DP ε to GDP μ for Gaussian differential privacy
problem Choosing the μ parameter in Gaussian differential privacy
method Matching the worst-case success of a membership inference attack
result Recommendation of μ ≈ ε/5 as a conservative general-purpose conversion
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.
Paper assesses the market value of sharing privacy-protected smart meter data.
problem Value of sharing privacy-protected smart meter data between consumers and load serving entities.
method Discounted differential privacy model, ANN-based load forecasting, optimal procurement problem.
result Significant value in sharing smart meter data while retaining individual consumer privacy.
Enhanced privacy, utility, and efficiency through MUST subsampling.
problem Balancing privacy, utility, and computational efficiency in data analysis.
method MUltistage Sampling Technique (MUST) for privacy amplification in differential privacy.
result MUST offers stronger privacy guarantees (ϵ) than one-stage subsampling methods while maintaining similar utility and computational efficiency. Privacy-preserving method protects user speech data from cloud services.
problem Privacy compromise in cloud-based speech analysis.
method Collects and sanitizes speech data before sharing, using transformation functions and voice conversion.
result Identification of sensitive emotional state reduced by ~96%.
2020 Census uses more noise to protect privacy than needed, improving data accuracy.
problem Ensuring privacy in census data while maintaining accuracy for policy decisions.
method Applied f-differential privacy to track and reduce noise across geographical levels. result The 2020 Census provides stronger privacy protections than its nominal guarantees suggest.
The remarkable development of deep learning in medicine and healthcare domain presents obvious privacy issues, when deep neural networks are built on users' personal and highly sensitive data, e.g., clinical records, user profiles, biomedical images, etc. However, only a few scientific studies on preserving privacy in …
Efficiently calculates privacy guarantees for 2020 Census data.
problem Evaluate privacy guarantees for 2020 U.S. Census data releases.
method Sieve-accelerated quadrature method to evaluate tail probabilities of high-dimensional convolutions.
result Achieves 1,824-fold speedup over prior methods while maintaining error tolerances.
SYNTHONY selects tabular synthesizers based on stress profiling and user intent.
problem Non-uniform performance of tabular generative models across datasets.
method Stress profiling and intent-conditioned tabular synthesis selection.
result Meta-features predict synthesizer performance, improving selection accuracy.
Paper presents a collaborative learning model to improve QoE models without sharing sensitive data.
problem Limited data volume and participant profiles lead to over-fitting and poor generalization of QoE models.
method Round-Robin based Collaborative Machine Learning training without sharing datasets.
result The proposed model outperforms conventional centralized and isolated learning methods.
FLeet improves online FL for mobile apps with better performance and privacy.
problem Federated Learning's offline nature limits its applicability for online updates.
method Combines staleness awareness and performance prediction with adaptive learning.
result 2.3x quality boost with minimal battery consumption.
Deep learning predicts user identity, activity, and location from Wi-Fi signals.
problem Privacy concerns and need for non-invasive user authentication, activity classification, and tracking.
method End-to-end deep learning framework using passive Wi-Fi signals.
result System autonomously predicts user identity, activity, and location without user intervention.
Paper addresses data heterogeneity in federated learning for CoxPH models in healthcare.
problem Data heterogeneity in federated learning of CoxPH models for healthcare.
method Feature-based clustering and event-based reporting strategy.
result Enhanced model accuracy and performance in federated survival analysis.
A method to produce personalized classification models to automatically review online dating profiles on Tinder is proposed, based on the user's historical preference. The method takes advantage of a FaceNet facial classification model to extract features which may be related to facial attractiveness. The embeddings fr…
Developed a new method to generate synthetic data while protecting privacy.
problem Protecting privacy of human participant data while making it publicly accessible.
method A multi-step framework based on Classification and Regression Trees and an original distance-based filtering.
result Satisfactory protection against attribute disclosure attacks and formal prevention of membership disclosure attacks.
Profile entropy measures learnability and compressibility of discrete distributions.
problem Understanding the learnability and compressibility of discrete distributions.
method Investigates profile entropy, showing its role in estimation, inference, and compression.
result Profile entropy is a fundamental measure unifying estimation, inference, and compression.
A method to describe Riemann surfaces using graph profiles is proposed.
problem Describing Riemann surfaces in a graph-theoretic framework.
method Graph profiles to represent Riemann surfaces, establishing necessary and sufficient conditions for their existence.
result A criterion for the existence of Riemann surfaces with a given signature.
In cheminformatics, compound-target binding profiles has been a main source of data for research. For data repositories that only provide positive profiles, a popular assumption is that unreported profiles are all negative. In this paper, we caution audience not to take this assumption for granted, and present empirica…
Method controls extrapolation in prediction profiles for statistical and machine learning models.
problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.
Study identifies subphenotypes of pediatric sepsis to improve ML predictive performance.
problem Enhance machine learning predictive performance in pediatric sepsis.
method Latent profile analysis of clinical data to identify subphenotypes, followed by ML experiments.
result Improved predictive performance of ML models targeting specific subphenotypes of pediatric sepsis.
XSP profiles ML models across hardware and software stacks.
problem Challenges in profiling ML model performance across different layers of the stack.
method XSP uses distributed tracing to aggregate data from various sources and introduces a leveled, iterative measurement approach.
result XSP provides insights into ML model execution not easily discernible otherwise.
Paper proposes a transfer learning approach for decentralized QoE estimation.
problem Challenges in QoE model development due to small datasets, user diversity, and IPR/privacy concerns.
method A transfer learning-based ML model training approach that allows decentralized local models to share generic indicators and customize them further.
result The approach shows advantages of stacking various generic and specific models with corresponding weight factors.
We equip many non compact non simply connected surfaces with smooth Riemannian metrics whose isoperimetric profile is smooth, a highly non generic property. The computation of the profile is based on a calibration argument, a rearrangement argument, the Bol-Fiala curvature dependent inequality, together with new result…
We introduce a spectrum of monotone coarse invariants for metric measure spaces called Poincaré profiles. The two extremes of this spectrum determine the growth of the space, and the separation profile as defined by Benjamini--Schramm--Timár. In this paper we focus on properties of the Poincaré profiles of groups with …
Logarithmic separation profile in hyperbolic groups shows hierarchical structure.
problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.
Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.
problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.
Study compares isoperimetric profiles on manifolds with integral Ricci curvature bounds.
problem Comparing isoperimetric profiles on manifolds with integral Ricci curvature bounds.
method Extending previous work, the study uses integral bounds on Ricci curvature to prove comparison results for isoperimetric profile functions.
result Comparison results for the Isoperimetric profile function in manifolds with integral bounds on Ricci curvature.
Estimates lower bounds for isoperimetric profiles and improves on previous estimates for specific manifolds.
problem Estimating lower bounds for isoperimetric profiles of specific Riemannian manifolds.
method Explicit lower bounds for isoperimetric profiles of Riemannian product manifolds.
result Improved lower bounds for isoperimetric profiles and Yamabe constants.
In the context of sub-Riemannian Heisenberg groups Hn, n \geq 1, we shall study Isoperimetric Profiles, which are closed compact hypersurfaces having constant horizontal mean curvature, very similar to ellipsoids. Our main goal is to study the stability of Isoperimetric Profiles.
Paper describes profiles of multivariate normal distributions and novel estimators for mutual information.
problem Estimating mutual information for complex distributions.
method Analytical description of profiles, introduction of Bend and Mix Models, Monte Carlo estimation.
result Bend and Mix Models accurately estimate mutual information profiles and provide Bayesian estimates.
Non-Negative Matrix Factorization, NMF, attempts to find a number of archetypal response profiles, or parts, such that any sample profile in the dataset can be approximated by a close profile among these archetypes or a linear combination of these profiles. The non-negativity constraint is imposed while estimating arch…
Random layer-wise pruning profiles are as effective as metric-based ones for various datasets.
problem Reduction of model size and computational resources in neural networks.
method Conducted baseline experiments, developed RL-based search algorithm for finding transferable layer-wise pruning profiles.
result RL-based layer-wise pruning profiles are as good or better than best profiles found on the original dataset via exhaustive search.
Study lampshuffler groups' isoperimetric profiles, refining previous estimates.
problem Relate isoperimetric profiles of lampshuffler groups to their base groups.
method Use lamplighter subgraphs and halo products to find optimal upper bounds.
result Sharp estimates for exponential growth groups, including Brieussel-Zheng groups.
New algorithms for efficient matrix profile computation using various Euclidean distances.
problem Efficiently computing matrix profile for all-pairs-similarity search on time series.
method Proposed AAMP, ACAMP, and extended algorithms for p-norm distance.
result AAMP and ACAMP algorithms outperform existing methods for specific Euclidean distances.
The study analyzes how large language models form and express investor risk profiles.
problem Understanding how large language models (LLMs) form and express investor risk profiles.
method Examined three LLMs (GPT, Gemini, and Llama) and assessed their responses to a standardized risk questionnaire under varying prompts.
result LLMs generally form long-term investment profiles, but they exhibit different risk tolerance levels.
A new tool, matrix profile, finds all pair similarities in time series data.
problem Finding all pair similarities in time series data.
method Near universal time series data mining tool called matrix profile.
result Matrix profile solves the all-pairs-similarity-search problem for time series subsequences.
Uniform Lipschitz continuity of isoperimetric profiles in evolving surfaces.
problem Uniform Lipschitz continuity of isoperimetric profiles in evolving surfaces.
method Normalized Ricci flow on compact surfaces.
result Uniform Lipschitz continuity of isoperimetric profiles under normalized Ricci flow.
A new framework for adaptive behavior using reusable value profiles.
problem Adaptive behavior in changing environments requires switching among value-control regimes, but maintaining separate parameters for each situation is impractical.
method Introduces value profiles: reusable bundles of parameters assigned to hidden states, allowing for state-conditional strategy recruitment without independent parameters for each context.
result Profile-based models outperform simpler alternatives in probabilistic reversal learning, suggesting belief-dependent control of adaptive behavior.
It is shown that, in dimensions <8, isoperimetric profiles of compact real analytic Riemannian manifolds are semi-analytic.
The hypercube's perimeter is significantly larger than expected near half volume.
problem Understanding the isoperimetric profile of the hypercube.
method Analytical proof of perimeter bounds and comparison to Gaussian isoperimetric profile.
result The isoperimetric profile of the hypercube does not converge to the Gaussian profile as dimension increases.
With the maturation of metabolomics science and proliferation of biobanks, clinical metabolic profiling is an increasingly opportunistic frontier for advancing translational clinical research. Automated Machine Learning (AutoML) approaches provide exciting opportunity to guide feature selection in agnostic metabolic pr…
The first known example of a complete Riemannian manifold whose isoperimetric profile is discontinuous is given.
apk2vec builds profiles of Android apps using multiple views, outperforming existing methods.
problem Building comprehensive behavior profiles of Android apps for better analytics.
method Semi-supervised multi-view representation learning combining RL and feature hashing.
result apk2vec's profiles significantly outperform state-of-the-art techniques in app analytics tasks.
Develops a method to disaggregate aerosol optical depth into vertical extinction profiles.
problem Uncertainty in measuring aerosol vertical distributions due to limited observations.
method Bayesian nonparametric Gaussian process modeling using meteorological predictors.
result Model reconstructs realistic extinction profiles with well-calibrated uncertainty, outperforming idealized baselines.
We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry plane. We show that such profiles are in a one-parameter family of curves which w…