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

19375674 · Jun 202019922001200920172026
48 results for Unreliable Resources

OpinionRank uses graph-based ranking to improve unreliable crowdsourced labels.

problem Improving trustworthiness of crowdsourced labels for machine learning.
method Graph-based spectral ranking to integrate unreliable labels.
result OpinionRank outperforms conventional algorithms in reliability and scalability.

Many machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process…

2017-10-14abs ↗pdf ↗

Classifier learns to ignore unreliable feedback from end users.

problem Improving classifier performance by filtering unreliable feedback.
method Modeling end users as autonomous agents, periodically retraining classifier with filtered feedback.
result Classifier can identify and filter out unreliable feedback, improving performance.

Automated detection of voice disorders with computational methods is a recent research area in the medical domain since it requires a rigorous endoscopy for the accurate diagnosis. Efficient screening methods are required for the diagnosis of voice disorders so as to provide timely medical facilities in minimal resourc…

2018-12-04abs ↗pdf ↗

Unified framework for scalable black-box optimization.

problem Expensive black-box evaluations in scientific and engineering domains.
method Integrates active learning, multi-armed bandits, and distributed computing.
result Consistently outperforms state-of-the-art black-box optimizers.

Study detects P-type bifurcations in single system realizations using unreliable kernel density estimates.

problem Detecting P-type bifurcations in signals with unreliable kernel density estimates.
method Create persistence diagrams from single system realization, statistically analyze resulting set, compare point process modeling methods.
result Subsampling outperforms other point process modeling methods in predicting P-type bifurcations.

Machine learning models predict bluebottles' presence on beaches, addressing class imbalance and unreliable absence data.

problem Predicting bluebottles' presence on beaches with machine learning, tackling class imbalance and unreliable absence data.
method Used Multilayer Perceptron, Random Forest, and XGBoost models; employed data augmentation techniques like SMOTE, Random Undersampling, and Synthetic Negative Approach.
result Random Forests combined with Synthetic Negative Approach provided the best predictive model, identifying wind direction as a key factor.

rMFBO improves MFBO by making it robust to unreliable low-fidelity sources.

problem Optimizing expensive functions with unreliable low-fidelity approximations.
method rMFBO (robust MFBO) integrates a theoretical guarantee to make GP-based MFBO robust to unreliable sources.
result rMFBO outperforms earlier MFBO methods on unreliable sources.

Simulation-based inference methods can produce unreliable posterior approximations.

problem Reliability of simulation-based inference methods for scientific use cases.
method Benchmarked algorithms including Neural Posterior Estimation, Neural Ratio Estimation, Sequential Neural Likelihood, and Approximate Bayesian Computation.
result Ensembling posterior surrogates provides more reliable approximations.

In principle, zero-shot learning makes it possible to train a recognition model simply by specifying the category's attributes. For example, with classifiers for generic attributes like \emph{striped} and \emph{four-legged}, one can construct a classifier for the zebra category by enumerating which properties it posses…

2014-09-15abs ↗pdf ↗

Paper tackles robust transfer learning with unreliable source data.

problem Challenges in robust transfer learning stemming from ambiguity in Bayes classifiers and weak transferable signals.
method Introduces ambiguity level, proposes Transfer Around Boundary (TAB) model, establishes general theorem.
result Demonstrates efficiency and robustness of TAB model improving classification while avoiding negative transfer.

Kriformer uses graph transformers to estimate data in sparse sensor areas.

problem Sparse sensor deployment and unreliable data in spatiotemporal kriging tasks.
method Graph transformer model with positional encoding and attention mechanisms.
result Kriformer excels in representing unobserved locations in spatiotemporal kriging tasks.

Recent anomaly detection benchmarks are flawed, potentially misleading progress.

problem Flawed benchmark datasets create misleading progress reports.
method Identified four flaws in benchmark datasets and introduced a new archive.
result Published comparisons may be unreliable due to flaws in benchmark datasets.

Study shows conventional data prep fails for insurance data, proposing new methods.

problem Challenges in data preparation for insurance data lead to unreliable models.
method Proposes a new data preparation framework using support points and Chatterjee correlation coefficient.
result New methods significantly enhance model robustness and reduce computational resource requirements.

TRIP detects unreliable feature importance scores in random forests.

problem Unreliable feature importance scores in random forests due to model extrapolation.
method Develops TRIP (Test for Reliable Interpretation via Permutation) to detect unreliable permutation feature importance scores.
result TRIP reliably detects unreliable permutation feature importance scores in high-dimensional settings.

We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…

2017-08-01abs ↗pdf ↗

Statsformer validates and adapts LLM-derived semantic priors for improved supervised learning.

problem Unreliable semantic priors from LLMs can degrade supervised learning performance.
method Adapts LLM-derived feature scores into a family of learner-specific prior-injection mechanisms, calibrating their influence using out-of-fold validation.
result Improves prediction performance by adaptively downweighting unreliable LLM priors, ensuring a guardrailed statistical learning system.

This paper proposes a decentralized reinforcement learning method for multi-agent resource allocation.

problem Allocating heterogeneous resources among multiple agents in a decentralized manner.
method Liquid-Graph-Time Clustering-IPPO, integrating dynamic cluster consensus.
result LGTC-IPPO achieves more stable rewards, better coordination, and robust performance.

New models improve morpheme segmentation in low-resource languages.

problem Improving morpheme segmentation in low-resource languages.
method Two new models: LSTM pointer-generator and sequence-to-sequence with hard monotonic attention.
result Novel models outperform existing ones by up to 11.4% accuracy in low-resource settings.

A new algorithm for resource-aware multi-armed bandits minimizes regret.

problem Optimizing resource usage in a multi-armed bandit problem with censored observations.
method UCB-inspired online learning algorithm with theoretical regret analysis.
result The proposed algorithm outperforms standard multi-armed bandit algorithms in simulations.

Generative AI reduces IR evaluation costs but introduces errors; this work provides reliable CIs.

problem Generating relevance annotations using AI introduces errors that affect IR evaluation metrics.
method Proposes two methods: prediction-powered inference and conformal risk control to place reliable CIs around IR metrics.
result Proposed methods accurately capture both variance and bias in evaluation based on AI-generated annotations.

Classification algorithms have been widely adopted to detect anomalies for various systems, e.g., IoT, cloud and face recognition, under the common assumption that the data source is clean, i.e., features and labels are correctly set. However, data collected from the wild can be unreliable due to careless annotations o…

2019-11-11abs ↗pdf ↗

Method estimates noise transition matrix from noisy labels without relying on unreliable class-posterior estimation.

problem Estimating noise transition matrix from noisy data.
method Total variation regularization to encourage distinguishable predicted probabilities.
result Consistent estimator of the noise transition matrix under mild assumptions.

PePR scores assess DL model performance per resource unit, promoting smaller, more efficient models.

problem Limited access to large-scale resources hinders medical image analysis research.
method Introduced PePR score to measure DL model performance per resource unit.
result Small-scale, specialized models outperform large-scale models in resource-constrained settings.

Two-Tailed Averaging improves generalization by optimizing the number of leading iterates to ignore.

problem Improving generalization in stochastic optimization with limited resources and hyperparameters.
method An anytime adaptive algorithm that balances the number of leading iterates to ignore for better generalization.
result Approximates the optimal tail at all optimization steps, improving generalization without hyperparameters.

Proposes a new framework for resource-limited recommendation.

problem Resource constraints affect user choices in recommendation tasks.
method Interest-behavior multiplicative network with MRRNNs and resource-limited branch.
result Framework effectively predicts user interactions considering resource limitations.

ReOPD uses pre-collected teacher trajectories to distill knowledge from multi-turn interactions.

problem The cost of fully online on-policy distillation for multi-turn interactions.
method ReOPD, an off-environment alternative that reuses pre-collected teacher trajectories as replayed prefixes, addressing the prefix trap and distribution shift.
result ReOPD preserves or improves OPD-level accuracy, uses zero tool calls, and is at least 4imes imes faster per training step.

Study resource allocation strategies in sequential decisions with unknown rewards.

problem Sequential resource allocation with unknown rewards.
method Design combinatorial multi-armed bandit algorithms for discrete or continuous budgets.
result Prove algorithms achieve logarithmic cumulative regret under semi-bandit feedback.

This paper presents an assessment of global economic energy potentials for all major natural energy resources. This work is based on both an extensive literature review and calculations using natural resource assessment data. Economic potentials are presented in the form of cost-supply curves, in terms of energy flows …

2012-05-21abs ↗pdf ↗

Generative profiling improves real-time task timing for varied resource contexts.

problem Inaccurate task timing analysis for complex hardware architectures.
method Nonparametric, conditional multi-marginal Schrödinger Bridge (MSB) formulation for synthesizing context-dependent timing profiles.
result Maximum likelihood accurate execution profiles for unseen resource contexts.

Paper tackles non-monotonic resource utilization in sequential decision-making.

problem Sequential decision-making under uncertainty with resource constraints.
method Introduces a new MDP policy with constant regret against LP relaxation.
result Develops a learning algorithm with logarithmic regret for unknown outcome distributions.

New loss function reduces outage probability in ML-assisted resource allocation.

problem Minimizing outage probability in ML-assisted resource allocation systems.
method Developed a novel loss function and trained an ML model to address the outage probability challenge.
result Exact and asymptotic expressions for the system's outage probability were established.

Sequence-to-sequence models predict resource usage for co-scheduled jobs in data centers.

problem Challenges in co-scheduling jobs due to resource interference and inefficiencies.
method Sequence-to-sequence models based on recurrent neural networks for workload interference prediction.
result Models accurately forecast resource usage trends from job profiles, improving scheduling decisions.