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

2985958931,190 · Jun 202019922001200920172026
48 results for data utility

New method for fair resource allocation in AI-aware networks with unknown utility functions.

problem Fair resource allocation in AI-aware communication networks with unknown utility functions.
method Distributed, data-driven bilevel optimization approach to learn surrogate utility functions.
result The proposed algorithm learns from data to autotune surrogate utility functions for unknown utility functions.

Paper establishes utility theory for synthetic data generation.

problem Lack of theoretical understanding in synthetic data utility.
method Statistical learning framework with two utility metrics: generalization and model ranking.
result Theoretical bounds for synthetic data utility metrics ensure comparable generalization and consistent model comparison.

A new model uses neural networks for consistent discrete choice analysis.

problem Difficulties in specifying utility functions in RUM models.
method Alternative-Specific and Shared weights Neural Network (ASS-NN) model.
result ASS-NN provides consistent outcomes without specifying utility form.

The paper tackles optimal policy learning with asymmetric counterfactual utilities in healthcare decisions.

problem Learning optimal policies from observed data with asymmetric counterfactual utilities.
method The approach involves identifying and minimizing the maximum expected utility loss using statistical decision theory and solving intermediate classification problems.
result One can learn minimax loss decision rules from observed data.

Optimal defenses protect FL models from gradient reconstruction attacks.

problem Gradient reconstruction attacks compromise FL models by recovering original data from shared gradients.
method Derive a theoretical lower bound of reconstruction error, customize noise and pruning defenses, and achieve optimal trade-off between leakage and utility.
result Our methods outperform Gradient Noise and Pruning in protecting training data and maintaining model utility.

BUDS balances privacy and utility by shuffling data, achieving strong privacy with minimal loss.

problem Balancing privacy and utility in crowd-sourced statistical databases.
method One-hot encoding, iterative shuffling, loss estimation, risk minimization.
result Achieves ε=0.02ε= 0.02 for privacy, maintaining a privacy bound of ε=ln[t/((n11)S)]ε= ln [t/((n_1 - 1)^S)].

The paper proposes using density ratio estimation to evaluate synthetic data quality.

problem Improving the quality and utility of synthetic data for analysis.
method Density ratio estimation to measure synthetic data quality.
result Density ratio estimation yields more accurate global utility estimates than existing methods.

Study shows privacy and utility trade-offs in synthetic data models, impacting fairness and real-world performance.

problem Understanding the impact of differential privacy on fairness and model performance in synthetic data.
method Systematic analysis of differentially private synthetic datasets on classification models, measuring utility and bias using fairness metrics.
result More privacy does not necessarily mean more bias, but it can affect model performance when deployed on real data.

Modern portfolio theory(MPT) addresses the problem of determining the optimum allocation of investment resources among a set of candidate assets. In the original mean-variance approach of Markowitz, volatility is taken as a proxy for risk, conflating uncertainty with risk. There have been many subsequent attempts to al…

2002-12-09abs ↗pdf ↗

RUMBoost combines RUMs and deep learning for better choice modelling.

problem Creating interpretable and robust discrete choice models.
method Gradient Boosted Regression Trees for utility functions, with constraints for interpretability and monotonicity.
result RUMBoost outperforms ML and RUM benchmarks in predictive performance and interpretability.

New method generates private synthetic data with optimal utility for smooth queries.

problem Achieving strong utility guarantees for meaningful downstream analysis of sensitive datasets.
method Proposes a polynomial-time algorithm for generating (ε,δ)(\varepsilon,δ)-differentially private synthetic data with minimax optimal error rates for smooth queries.
result Achieves a minimax error rate of Ok,d(nmin{1,kd})O_{k,d}(n^{-\min \{1, \frac{k}{d}\}}) for kk-smooth queries, up to a log(n)\log(n) factor.

The study bounds the utility of empirically optimal portfolios using stock return data.

problem Maximizing expected ratio of portfolio utility to best asset utility.
method High probability utility bounds derived from Lipschitz or Hölder continuous utility functions.
result Utility bounds depend on utility function, number of assets, and observations.

This paper proposes a systematic framework to design a classification model that yields a classifier which optimizes a utility function based on prior knowledge. Specifically, as the data size grows, we prove that the produced classifier asymptotically converges to the optimal classifier, an extended version of the Bay…

2018-09-05abs ↗pdf ↗

Study reveals Data Shapley's inconsistent performance in data selection tasks.

problem Inconsistency of Data Shapley's performance in data selection across different settings.
method Hypothesis testing framework and identification of utility functions.
result Data Shapley's performance is no better than random selection without specific constraints.

Sequential pattern mining is an interesting research area with broad range of applications. Most prior research on sequential pattern mining has considered point-based data where events occur instantaneously. However, in many application domains, events persist over intervals of time of varying lengths. Furthermore, tr…

2019-12-24abs ↗pdf ↗

Differential privacy is a mathematical framework for privacy-preserving data analysis. Changing the hyperparameters of a differentially private algorithm allows one to trade off privacy and utility in a principled way. Quantifying this trade-off in advance is essential to decision-makers tasked with deciding how much p…

2019-05-26abs ↗pdf ↗

Synthetic tabular data synthesis models balance utility and risk.

problem Generating synthetic tabular data for regulated domains.
method Latent flow models with various learning targets, paths, and sampling methods.
result Velocity and posterior matching objectives yield higher utility, while score and noise matching achieve lower risk.

Research optimizes a small RES utility's portfolio by dynamically trading in German electricity markets.

problem Managing risks in RES producers and electricity traders in changing electricity markets.
method Uses SVAR model to estimate market relationships and data-driven trading strategies to optimize revenue and reduce risk.
result Data-driven trading strategies increase utility revenue and reduce trading risk.

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.

DiPriMe forests use private medians to create balanced tree splits for privacy-protected data.

problem Privacy concerns in training random forests due to multiple data queries.
method Proposes DiPriMe forests, which use a private median to generate balanced splits, ensuring differential privacy.
result DiPriMe forests achieve high utility while maintaining differential privacy, as shown both theoretically and empirically.

FELICIA uses a centralized adversary to improve synthetic medical image generation.

problem Collaborative learning with limited and biased data in medical image analysis.
method Federated generative modeling with a centralized adversary.
result Data owners can generate high-quality synthetic images with high utility without sharing real data.

Study uses reinforcement learning to optimize portfolios under recursive utility.

problem Improving portfolio allocation using risk-sensitive objectives.
method Approximated certainty equivalent via Monte Carlo, trained actor-critic algorithms (PPO, A2C).
result Recursive-utility agent outperforms discounted baseline in Sharpe ratio, max drawdown, and cumulative return.

In many scenarios, humans prefer a text-based representation of quantitative data over numerical, tabular, or graphical representations. The attractiveness of textual summaries for complex data has inspired research on data-to-text systems. While there are several data-to-text tools for time series, few of them try to …

2020-01-16abs ↗pdf ↗

Investigations have been performed into using clustering methods in data mining time-series data from smart meters. The problem is to identify patterns and trends in energy usage profiles of commercial and industrial customers over 24-hour periods, and group similar profiles. We tested our method on energy usage data p…

2016-03-24abs ↗pdf ↗

NPO method improves LLM unlearning without catastrophic collapse.

problem Efficiently unlearning undesirable data from LLMs without losing model utility.
method Negative Preference Optimization (NPO) method based on alignment.
result NPO-based methods achieve better unlearning results and maintain model utility.

The input data features set for many data driven tasks is high-dimensional while the intrinsic dimension of the data is low. Data analysis methods aim to uncover the underlying low dimensional structure imposed by the low dimensional hidden parameters by utilizing distance metrics that consider the set of attributes as…

2016-06-28abs ↗pdf ↗

Study learns linear utility functions from comparisons, showing learnability gaps between passive and active learning.

problem Learn linear utility functions from pairwise comparison queries.
method Analyzes passive and active learning settings, considering noise-free and noisy query responses.
result Efficient learnability of linear utilities in passive learning, but not for utility parameters without strong assumptions.

It is becoming increasingly clear that users should own and control their data. Utility providers are also becoming more interested in guaranteeing data privacy. As such, users and utility providers should collaborate in data privacy, a paradigm that has not yet been developed in the privacy research community. We intr…

2018-05-18abs ↗pdf ↗

Pruning neural networks adds differential privacy noise, preserving data utility.

problem Achieving differential privacy in neural networks without sacrificing data utility.
method Proving equivalence between pruning and adding differential privacy noise to hidden-layer activations.
result Pruning can be a more effective alternative to adding differential privacy noise for neural networks.

Random utility theory models an agent's preferences on alternatives by drawing a real-valued score on each alternative (typically independently) from a parameterized distribution, and then ranking the alternatives according to scores. A special case that has received significant attention is the Plackett-Luce model, fo…

2012-11-11abs ↗pdf ↗

ARF synthesizes epidemiological data to match original findings.

problem Synthetic data quality and privacy in epidemiology.
method Adversarial Random Forests (ARF) for efficient data synthesis.
result ARF-generated synthetic data consistently matches original epidemiological findings.