Research
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

2815618421,122 · Jun 202019922001200920172026
48 results for data release

Privacy is enhanced by synthetic data release even with unlimited data.

problem Improving privacy guarantees for synthetic data release.
method Analyzing a bounded-parameter assumption to show privacy amplification persists with unlimited synthetic records.
result Privacy amplification is possible even with an unbounded number of synthetic records.

User releases data to service provider while balancing privacy and utility.

problem Balancing user privacy and service utility in data release.
method Formulated as a Markov decision process (MDP) and solved using deep reinforcement learning (RL).
result Achieved a trade-off between revealing useful information and protecting sensitive data.

GRAND ensures node-level differential privacy for network data.

problem Lack of node-level differential privacy for network data.
method Proposes GRAND, the first mechanism for releasing networks with node-level differential privacy and preserving structural properties.
result GRAND releases networks while ensuring node-level differential privacy and preserving structural properties.

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.

New algorithm maintains privacy while improving model performance in selective release.

problem Privacy degradation and slow convergence in DPSGD.
method Differentially Private Selective Release based on Clipped Gradients (DPSR-CG).
result Maintains strict privacy guarantees while achieving exceptional model performance.

We lay theoretical foundations for new database release mechanisms that allow third-parties to construct consistent estimators of population statistics, while ensuring that the privacy of each individual contributing to the database is protected. The proposed framework rests on two main ideas. First, releasing (an esti…

2017-10-04abs ↗pdf ↗

New framework predicts earnings announcements using press release content, surpassing earnings surprises.

problem Predicting stock returns based on earnings press releases.
method Compared traditional and BERT-based embeddings of press releases, finding content as informative as earnings surprises.
result FinBERT yields highest predictive power for earnings announcement returns.

This paper provides a method for noise-calibrated inference from DP synthetic data.

problem Inference from DP synthetic data is often miscalibrated and lacks principled uncertainty quantification.
method Release DP sufficient statistics, perform noise-calibrated likelihood-based inference, and optional synthetic data generation.
result Asymptotic normality and valid confidence intervals for the plug-in DP MLE.

Releasing full data records is one of the most challenging problems in data privacy. On the one hand, many of the popular techniques such as data de-identification are problematic because of their dependence on the background knowledge of adversaries. On the other hand, rigorous methods such as the exponential mechanis…

2017-08-26abs ↗pdf ↗

New algorithm corrects bias in LDP-released data for better analysis.

problem Bias in data released under Local Differential Privacy (LDP).
method Inverse Weierstrass Private Stochastic Gradient Descent (IWP-SGD).
result Converges to true population risk minimizer at O(1/n)\mathcal{O}(1/n) rate.

A new method for releasing AI workflows to avoid premature incorrect results.

problem Statistical challenges in releasing AI workflows with adaptive scoring.
method Wrapper that calibrates and accumulates evidence from high-scoring failures.
result Reduces premature incorrect release while still releasing on moderate evidence.

This work addresses privacy issues in IoT data sharing by balancing information disclosure and user privacy.

problem Balancing privacy and utility in time-series data sharing from IoT devices.
method Formulated as POMDPs, solved using A2C DRL, evaluated with synthetic and real data.
result Proposed policies achieve a good balance between privacy and utility.

Designing a data sharing mechanism without sacrificing too much privacy can be considered as a game between data holders and malicious attackers. This paper describes a compressive adversarial privacy framework that captures the trade-off between the data privacy and utility. We characterize the optimal data releasing …

2018-09-21abs ↗pdf ↗

Three new oracle-efficient algorithms for private synthetic data release.

problem Constructing private synthetic data that preserves statistical query answers.
method Oracle-efficient algorithms using optimization oracles for differential privacy.
result Better accuracy in large workload and high privacy regime compared to state-of-the-art.

Differential privacy allows quantifying privacy loss resulting from accessing sensitive personal data. Repeated accesses to underlying data incur increasing loss. Releasing data as privacy-preserving synthetic data would avoid this limitation, but would leave open the problem of designing what kind of synthetic data. W…

2019-12-10abs ↗pdf ↗

P3GM improves privacy-preserving data synthesis for high-dimensional data.

problem Mitigating privacy risks in releasing large volumes of sensitive data.
method Privacy-preserving phased generative model (P3GM) with two-phase learning process.
result P3GM significantly outperforms existing solutions in terms of noise reduction and data accuracy.

CET model uses contrastive learning to improve earnings data predictions.

problem Inaccurate stock predictions due to earnings data's irregular release and fast obsolescence.
method Contrastive Predictive Coding (CPC) for self-supervised learning of earnings data.
result CET model outperforms benchmarks in predicting stock price trends over time.

Smart Meters (SMs) are able to share the power consumption of users with utility providers almost in real-time. These fine-grained signals carry sensitive information about users, which has raised serious concerns from the privacy viewpoint. In this paper, we focus on real-time privacy threats, i.e., potential attacker…

2019-06-14abs ↗pdf ↗

Paper addresses private online convex optimization with optimal algorithms in various geometries and high-dimensional bandits.

problem Private online convex optimization with streaming and continual release data.
method Proposes a private variant of online Frank-Wolfe algorithm with recursive gradients for variance reduction.
result Achieves optimal excess risk in linear time for 1<p21<p\leq 2 and state-of-the-art excess risk for 2<p2<p\leq\infty.

BioFinBERT analyzes sentiment of biotech press releases and financial text around inflection points.

problem Analyzing sentiment of biotech press releases and financial text around inflection points.
method Finetuning BioBERT on financial datasets to create BioFinBERT for sentiment analysis.
result BioFinBERT accurately analyzes sentiment of biotech press releases and financial text around inflection points.

Synthetic data can amplify privacy in linear regression models.

problem Understanding how synthetic data can enhance privacy in linear regression models.
method Investigated through the linear regression framework, analyzing synthetic data generated from random inputs and controlled inputs.
result Releasing a limited number of synthetic data points amplifies privacy beyond the model's inherent guarantees when inputs are random, but not when inputs are controlled by an adversary.

Differential privacy is a framework for privately releasing summaries of a database. Previous work has focused mainly on methods for which the output is a finite dimensional vector, or an element of some discrete set. We develop methods for releasing functions while preserving differential privacy. Specifically, we sho…

2012-03-12abs ↗pdf ↗

New method for estimating median and mean with high probability privacy.

problem Estimating median and mean with differential privacy.
method Propose, Test, Release (PTR) mechanism with concentration inequalities.
result First sub-Gaussian high probability bounds for differentially private median and mean estimation.

With the proliferation of mobile devices and the internet of things, developing principled solutions for privacy in time series applications has become increasingly important. While differential privacy is the gold standard for database privacy, many time series applications require a different kind of guarantee, and a…

2017-07-10abs ↗pdf ↗

Study investigates micro-event detection on FLOSS version releases from Stack Overflow.

problem Detecting micro-events in FLOSS version release events from textual messages.
method Developed pipelines using LDA topic modeling, hSBM topics, and sentiment analysis; optimized feature spaces with RFECV; evaluated models with statistical analysis.
result Found characteristic changes in topics or sentiment features before or after FLOSS version releases.

We introduce GraSPy, a Python library devoted to statistical inference, machine learning, and visualization of random graphs and graph populations. This package provides flexible and easy-to-use algorithms for analyzing and understanding graphs with a scikit-learn compliant API. GraSPy can be downloaded from Python Pac…

2019-03-29abs ↗pdf ↗

Framework for efficient statistical estimation with privacy guarantees.

problem Statistical estimation problems with differential privacy constraints.
method High-dimensional Propose-Test-Release (HPTR) framework combining exponential mechanism, robust statistics, and resilience.
result Near-optimal utility guarantees and tight local sensitivity bounds for various statistical problems.

Many commonly used learning algorithms work by iteratively updating an intermediate solution using one or a few data points in each iteration. Analysis of differential privacy for such algorithms often involves ensuring privacy of each step and then reasoning about the cumulative privacy cost of the algorithm. This is …

2018-08-20abs ↗pdf ↗

We propose a novel computational strategy for de novo design of molecules with desired properties termed ReLeaSE (Reinforcement Learning for Structural Evolution). Based on deep and reinforcement learning approaches, ReLeaSE integrates two deep neural networks - generative and predictive - that are trained separately b…

2017-11-29abs ↗pdf ↗

Widely-used public benchmarks are of huge importance to computer vision and machine learning research, especially with the computational resources required to reproduce state of the art results quickly becoming untenable. In medical image computing, the wide variety of image modalities and problem formulations yields a…

2019-08-12abs ↗pdf ↗

The study provides a practical strategy for pricing and hedging equity-release mortgages guarantees.

problem Pricing and hedging the No-Negative-Equity-Guarantee in incomplete markets.
method Discrete-time model, Excess-of-Loss reinsurance, numerical illustrations.
result Superhedge cost decreases with more lives in the portfolio, making it more realistic.