Machine learning (ML) is probably the first and foremost used technique to deal with the size and complexity of the new generation of data. In this paper, we analyze one of the means to increase the performances of ML algorithms which is exploiting data locality. Data locality and access patterns are often at the heart…
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,932 papers · 148 categories
Trend · papers per month
48 results for “data accessibility”
Paper develops AGLD for MCMC with bounds for various data access strategies.
problem Efficient MCMC sampling for large-scale Bayesian posterior learning.
method Aggregated Gradient Langevin Dynamics framework with unified analysis.
result Unified bounds for cyclic access and random reshuffle strategies.
GrateTile optimizes CNN feature map storage for efficient data access.
problem Efficient storage and access of sparse CNN feature maps.
method Divides feature maps into uneven-sized subtensors, compresses and stores them in a compressed yet accessible format.
result Average 55% DRAM bandwidth reduction with minimal indexing overhead.
In this paper we propose a framework for automated forecasting of energy-related time series using open access data from European Network of Transmission System Operators for Electricity (ENTSO-E). The framework provides forecasts for various European countries using publicly available historical data only. Our solutio…
The Oracle of DLphics.LG
We present a novel technique based on deep learning and set theory which yields exceptional classification and prediction results. Having access to a sufficiently large amount of labelled training data, our methodology is capable of predicting the labels of the test data almost always even if the training data is entir…
Leveraging Large Language Models to Democratize Access to Costly Datasets for Academic Researchq-fin.GN
LLMs help less-resourced researchers access costly data.
problem Unequal access to costly datasets limits research contributions.
method RAG framework with GPT-4o-mini for automated data collection.
result LLMs can collect CEO pay ratios and CAMs from corporate disclosures with high accuracy and low cost.
Using Satellite Imagery and Machine Learning to Estimate the Livelihood Impact of Electricity Accessecon.GN
Satellite imagery and ML improve livelihood measurements and estimate electrification's impact.
problem Sparse data hinders policy development and evaluation.
method Satellite imagery, machine learning, and ML inference techniques.
result Grid access improves rural asset wealth by 0.17 standard deviations.
RealMix improves SSL performance with real-world data challenges.
problem Poor SSL performance when labeled and unlabeled data distributions differ.
method Develops RealMix, a new SSL algorithm.
result Achieves state-of-the-art results on standard benchmark datasets.
Framework reuses pre-trained models for data-free transfer learning.
problem Challenges in retrieving source data for model training.
method Model Recycling Framework for parameter-efficient training.
result Makes multi-source data-free supervised transfer learning possible.
In this paper we study a family of variance reduction methods with randomized batch size---at each step, the algorithm first randomly chooses the batch size and then selects a batch of samples to conduct a variance-reduced stochastic update. We give the linear convergence rate for this framework for composite functions…
Role mining tackles the problem of finding a role-based access control (RBAC) configuration, given an access-control matrix assigning users to access permissions as input. Most role mining approaches work by constructing a large set of candidate roles and use a greedy selection strategy to iteratively pick a small subs…
The effect of data encoding on the expressive power of variational quantum machine learning modelsquant-ph
Quantum models can approximate any function if data encoding allows for a rich enough frequency spectrum.
problem Theoretical properties of quantum machine learning models, particularly their expressive power.
method Investigated how data encoding affects the expressive power of parametrized quantum circuits.
result Quantum models can access increasingly rich frequency spectra by repeating data encoding gates, potentially making them universal function approximators.
Machine learning (ML) models may be deemed confidential due to their sensitive training data, commercial value, or use in security applications. Increasingly often, confidential ML models are being deployed with publicly accessible query interfaces. ML-as-a-service ("predictive analytics") systems are an example: Some …
The FAIRnets Ontology makes neural networks findable, accessible, interoperable, and reusable.
problem The resource-intensive training of neural networks and the lack of training data availability.
method Development of FAIRnets Ontology to model neural networks on a meta-level and creation of a knowledge graph (FAIRnets) of over 18,400 neural networks.
result The FAIRnets Ontology and knowledge graph enable the reuse and recommendation of neural networks to data scientists.
Study creates open-access wildfire dataset for Russia.
problem Data scarcity for comprehensive Eurasian wildfire research.
method Machine learning for exploratory data analysis and predictive modeling.
result Identified key environmental factors influencing fire behavior.
FinGPT is an open-source financial LLM for democratizing financial data.
problem Accessing high-quality financial data for LLMs.
method Data-centric approach with automatic data curation and low-rank adaptation.
result FinGPT provides accessible and transparent financial data for FinLLMs.
Multi-party machine learning leaks global dataset properties even with black-box access.
problem Leakage of global dataset properties in multi-party machine learning.
method Demonstrated leakage of sensitive attribute distributions in pooled data.
result A curious party can infer sensitive attribute distributions in other parties' data with high accuracy.
Paper speeds up IoT device detection and data decoding.
problem Efficiently detect and decode massive IoT devices in grant-free random access.
method Develops multi-armed bandit approaches for more efficient detection via coordinate descent.
result Proposed bandit based algorithms achieve faster convergence rates with lower time complexity.
A new method for unlearning trained models without needing the original data.
problem Lack of access to original training data for privacy-preserving unlearning.
method Uses a surrogate dataset to approximate statistical properties and calibrates noise based on statistical distance.
result Effective unlearning of trained models with strong privacy guarantees, even without access to the original data.
Parrot learns optimal cache replacement policies using imitation learning.
problem Improving cache hit rates in complex access patterns.
method Imitation learning approach using Belady's oracle policy.
result Parrot increases cache hit rates by 61% on a web search benchmark.
We perform the first study of the tradeoff space of access methods and replication to support statistical analytics using first-order methods executed in the main memory of a Non-Uniform Memory Access (NUMA) machine. Statistical analytics systems differ from conventional SQL-analytics in the amount and types of memory …
A novel Gradient-Based Multiple Access algorithm for distributed learning over fading channels.
problem Distributed learning over multiple access fading channels.
method Gradient-Based Multiple Access (GBMA) algorithm, using analog gradients and common shaping waveforms.
result GBMA can approach the convergence rate of centralized gradient descent in large networks.
This paper enhances ML algorithms by improving data locality and reducing redundancy.
problem Improving performance of machine learning algorithms with complex data.
method Exploiting data locality and reuse in memory hierarchies of modern processors.
result Efficient implementation of machine learning algorithms can be achieved by reusing computation results.
MIMIC-Extract transforms EHR data for reproducible healthcare machine learning.
problem Lack of accessible, standardized healthcare data for machine learning.
method Open-source pipeline for converting raw EHR data into usable dataframes.
result Demonstrates utility through benchmark tasks and baseline results.
Classical clients can verify quantum learning tasks efficiently.
problem Making quantum learning accessible to classical clients.
method Developed a framework for classical verification of quantum learning.
result Quantum learning tasks can be efficiently verified by classical verifiers.
New methods protect privacy while providing accurate prediction sets.
problem Privacy-preserving conformal prediction for untrusted aggregators.
method Two LDP approaches: k-ary randomized response and binary search response.
result Finite-sample coverage guarantees and robust coverage under randomization.
Nowadays, the major challenge in machine learning is the Big Data challenge. The big data problems due to large number of data points or large number of features in each data point, or both, the training of models have become very slow. The training time has two major components: Time to access the data and time to pro…
This paper proposes a new estimation algorithm for the parameters of an HMM as to best account for the observed data. In this model, in addition to the observation sequence, we have \emph{partial} and \emph{noisy} access to the hidden state sequence as side information. This access can be seen as "partial labeling" of …
Deep generative networks can simulate from a complex target distribution, by minimizing a loss with respect to samples from that distribution. However, often we do not have direct access to our target distribution - our data may be subject to sample selection bias, or may be from a different but related distribution. W…
Proposes using probabilistic models for privacy-preserving synthetic data.
problem Designing high-quality synthetic data for privacy preservation.
method Formulate the problem through probabilistic modelling, choosing a model for the data.
result Statistical discoveries can be reliably reproduced from synthetic data.
Bayesian method learns from aggregated quantile data.
problem Limited access to sensitive personal data.
method Bayesian quantile matching estimation based on order statistics.
result Correctly reflects uncertainty of empirical quantiles.
New method uses synthetic data to validate financial agent classification.
problem Validation of machine learning methods for financial agent classification.
method Agent-based model to generate synthetic data for validation.
result Unsupervised clustering may give incorrect results for financial agents.
Theorem ensures superior learning outcomes for authorized learners with quantum label encoding.
problem Ensuring data security for authorized learners in machine learning.
method Quantum label encoding and PAC learning framework.
result Authorized learners achieve superior learning outcomes while eavesdroppers do not.
Private method measures nonlinear correlations between data hosted across two entities.
problem Measuring nonlinear correlations between sensitive data hosted across multiple parties while preserving privacy.
method Differentially private estimator of distance correlation.
result First private estimator of nonlinear correlations in a multi-party setup.
WAFFLE embeds watermarks in federated learning models without access to training data.
problem Model theft in federated learning due to lack of centralized control.
method Retraining step at server after model aggregation, generating backdoor as watermark.
result Efficient embedding of resilient watermark with negligible accuracy loss.
ModHiFi identifies critical components for model modification without gradients or loss function.
problem Modifying open weight models without access to training data or loss function.
method Theoretical analysis of Lipschitz-continuous networks, Subset Fidelity metric, and ModHiFi algorithm.
result ModHiFi-P and ModHiFi-U achieve significant performance improvements in model pruning and unlearning.
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.
Proposes a new method to selectively access privileged information in reinforcement learning.
problem Selective compression of privileged information in reinforcement learning.
method Formulates a variational bandwidth bottleneck to decide stochastically whether to access privileged information.
result Improves generalization and reduces access to costly information in reinforcement learning experiments.
Paper proposes detecting OOD examples using Gram matrices and in-distribution data.
problem Detecting OOD examples with confidence and without OOD data.
method Characterize activity patterns with Gram matrices and identify anomalies in values.
result High OOD detection rates achieved without OOD data.
Study develops sign recognition system for DHH users.
problem Accessibility of voice-controlled devices for Deaf and Hard-of-Hearing users.
method Multimodal data (RGB video and skeletal data) for sign language recognition using deep learning.
result Validation on GMUASL51 dataset of 12 users and 13107 samples across 51 signs.
Proposes a deep reinforcement learning framework for dynamic multichannel access.
problem Efficient use of limited spectral resources in dynamic multichannel access.
method Deep actor-critic reinforcement learning framework for both single-user and multi-user scenarios.
result Demonstrates improved performance and adaptive ability compared to existing methods.
New attack method makes poisoned images transferable without access to victim model.
problem Injecting poisoned images into training data to mislead deep nets.
method Designing poison images to surround targeted images in feature space, using Dropout.
result Achieves over 50% transferable success with only 1% poisoning of training set.
Improved Sample Complexity For Diffusion Model Training Without Empirical Risk Minimizer Accesscs.LG
Improved sample complexity for diffusion models without needing empirical risk minimizers.
problem Theoretical limitations in sample complexity for diffusion models.
method Structured decomposition of score estimation error, eliminating dependence on neural network parameters.
result Achieved sample complexity bound of O(ε^(-4)) without empirical risk minimizer access.
New method generates clean data from corrupted observations.
problem Generating clean data from corrupted observations.
method Iterative update of a transport map using black-box corruption channel access.
result Converges to a self-consistent transport map that effectively inverts the corruption channel.
We use an accessibility result of Delzant and Potyagailo to prove Swarup's Strong Accessibility Conjecture for Gromov hyperbolic groups with no 2-torsion. It follows that, if M is an irreducible, orientable, compact 3-manifold with hyperbolic fundamental group, then any hierarchy in which M is decomposed alternately al…
Study on women entrepreneurs' access to finance in France.
problem Inequalities in accessing external finance for women entrepreneurs in France.
method Quantitative approach using data from a representative sample of women entrepreneurs.
result Founder status affects access to external finance; increases success in fundraising but reduces bank finance.
Proves bounds on copyright risk for generative models.
problem Generative models risk producing similar content to copyrighted data.
method Defines NAF, proves bounds, and provides learning algorithms.
result Generative models can be made less likely to produce copyrighted content.
Study finds ML4H lacks reproducibility compared to other fields.
problem Lack of reproducibility in ML4H research.
method Systematic evaluation of 100 ML4H papers.
result ML4H research is less reproducible than other fields.