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,742 papers · 148 categories

Trend · papers per month

5111621 · Jun 202019922001200920172026
48 results for pre-trial release

Improves pre-trial risk assessments by making them safer without changing existing rules.

problem Improving pre-trial risk assessments while maintaining deterministic rules.
method Developed a maximin robust optimization approach to find a safer policy.
result Can safely improve certain components of the risk assessment instrument.

We explore the problem of learning under selective labels in the context of algorithm-assisted decision making. Selective labels is a pervasive selection bias problem that arises when historical decision making blinds us to the true outcome for certain instances. Examples of this are common in many applications, rangin…

2018-07-02abs ↗pdf ↗

Predictive modeling is increasingly being employed to assist human decision-makers. One purported advantage of replacing human judgment with computer models in high stakes settings-- such as sentencing, hiring, policing, college admissions, and parole decisions-- is the perceived "neutrality" of computers. It is argued…

2016-10-25abs ↗pdf ↗

Recidivism prediction provides decision makers with an assessment of the likelihood that a criminal defendant will reoffend that can be used in pre-trial decision-making. It can also be used for prediction of locations where crimes most occur, profiles that are more likely to commit violent crimes. While such instrumen…

2019-09-18abs ↗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.

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.

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.

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.

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.

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 ↗

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.

Proposes minimal interventions over counterfactual explanations for algorithmic recourse.

problem Lack of actionable recommendations for algorithmic recourse.
method Causal reasoning to shift focus from explanations to recommendations.
result Minimal interventions provide more actionable recommendations for recourse.

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 ↗

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.

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.

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 ↗

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 ↗

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.

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.

Additive noise protects privacy in releasing datasets for SVM classification.

problem Maintaining privacy in releasing datasets for SVM classification.
method Additive noise applied to obfuscate the dataset, optimizing privacy and utility measures.
result Optimal noise distribution ensures close classifier performance between original and obfuscated datasets, achieving local differential privacy.

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.

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 ↗

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 ↗

Framework purifies approximate differential privacy to pure differential privacy.

problem Achieving pure differential privacy from approximate differential privacy.
method Randomized post-processing with calibrated noise to eliminate δ parameter.
result First statistically and computationally efficient reduction from approximate DP to pure DP.

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 ↗

For a dataset of label-count pairs, an anonymized histogram is the multiset of counts. Anonymized histograms appear in various potentially sensitive contexts such as password-frequency lists, degree distribution in social networks, and estimation of symmetric properties of discrete distributions. Motivated by these app…

2019-10-08abs ↗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.

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.

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 ↗

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.