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

219438656875 · Jun 202019922001200920172026
48 results for algorithmic triage

Machine learning and C-NLP improve emergency department triage accuracy.

problem Improving accuracy in emergency department triage to manage increased volume.
method Historical EHR data, clinical natural language processing, and ML algorithms (KATE).
result KATE predicts ESI acuity assignments 75.9% of the time, significantly better than nurses.

SpeakerStew verifies 46 languages with reduced training and inference costs.

problem Speaker verification for 46 languages with smart speaker interactions.
method Pooling multilingual data, triage between text-dependent and text-independent models.
result Training on multiple languages generalizes well and reduces computational requirements.

Framework uses human judgment to distinguish algorithmically indistinguishable cases.

problem Clarifying human-AI collaboration in prediction and decision tasks.
method Integrates human judgment to distinguish algorithmically indistinguishable cases.
result Improves performance of any feasible algorithmic predictor.

Bayesian neural networks improve SHD classification and uncertainty quantification.

problem Improving screening for structural heart disease using noninvasive ECG and echocardiography.
method Comparing frequentist and Bayesian neural network classifiers on the EchoNext dataset.
result Bayesian classifiers provide more robust uncertainty quantification.

The standard approach to compressive sampling considers recovering an unknown deterministic signal with certain known structure, and designing the sub-sampling pattern and recovery algorithm based on the known structure. This approach requires looking for a good representation that reveals the signal structure, and sol…

2016-02-01abs ↗pdf ↗

In this work we explore the use of metric index structures, which accelerate nearest neighbor queries, in the scenario where we need to interleave insertions and queries during deployment. This use-case is inspired by a real-life need in malware analysis triage, and is surprisingly understudied. Existing literature ten…

2018-01-12abs ↗pdf ↗

Analyzes COVID-19 data to predict mortality, forecast spread, and optimize resource allocation.

problem Challenges in patient triage, treatment, and care management during the pandemic.
method Integrated four-step approach combining descriptive, predictive, and prescriptive analytics.
result Optimized resource allocation and informed policy decisions.

Many data-rich industries are interested in the efficient discovery and modelling of structures underlying large data sets, as it allows for the fast triage and dimension reduction of large volumes of data embedded in high dimensional spaces. The modelling of these underlying structures is also beneficial for the creat…

2019-09-27abs ↗pdf ↗

Deep learning model predicts severe COVID-19 outcomes.

problem Predicting severe COVID-19 outcomes in ED patients.
method Deep feature fusion model using EHR data and CXR images.
result CO-RISK score achieved AUC of 0.95 and 0.92 for 24 and 72 hours predictions, superior to human performance.

Framework detects and ranks suspicious market manipulation using temporal convolutions and expert assessment.

problem Detecting and deterring rogue agents in financial markets.
method Weakly supervised learning, expert assessment, similarity search.
result Promising preliminary results in detecting and ranking suspicious market manipulation.

New DL algorithm detects critical chest X-ray findings without manual annotations.

problem Lack of explainability and manual annotation costs for DL models in medical imaging.
method Multi-instance learning approach to jointly classify and localize critical findings in CXR.
result Competitive classification results on three CXR datasets.

Much work aims to explain a model's prediction on a static input. We consider explanations in a temporal setting where a stateful dynamical model produces a sequence of risk estimates given an input at each time step. When the estimated risk increases, the goal of the explanation is to attribute the increase to a few r…

2019-07-10abs ↗pdf ↗

Historically, machine learning in computer security has prioritized defense: think intrusion detection systems, malware classification, and botnet traffic identification. Offense can benefit from data just as well. Social networks, with their access to extensive personal data, bot-friendly APIs, colloquial syntax, and …

2018-02-14abs ↗pdf ↗

Dynamic CBDT improves treatment effect estimation in clinical data.

problem Estimating heterogeneous treatment effects in observational data with high accuracy and interpretability.
method Dynamic Regularized Causal Boosted Decision Trees (CBDT) integrating variance regularization and calibration.
result Significantly improved estimation accuracy and reliable coverage of true treatment effects.

Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions to measure evidence conflict and stability.

problem Modern data analysis lacks mechanisms to show the clarity, conflict, or stability of evidence behind predictions.
method Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions.
result SEF measures conflict and stability, and shows that conflict can improve loss prediction beyond confidence.

Examines algorithmic modeling across three cultures.

problem Tackles algorithmic modeling in different cultural contexts.
method Uses parametric regressions, interpretable algorithms, and complex algorithms.
result Extension of Leo Breiman's thesis to include cultural differences.

Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that UCBUCB, M3M3, SS or Exp3Exp3 algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on predi…

2018-10-15abs ↗pdf ↗

Meta-algorithm selection aims to choose the best algorithm selector for a given problem instance.

problem Selecting the best algorithm selector for a specific problem instance.
method Apply algorithm selection to the selection of other algorithms (meta-algorithm selection).
result Meta-algorithm selection can be beneficial in some cases but faces challenges in solving the meta-level problem.

Combines multiple bandit algorithms to create a nearly optimal single algorithm.

problem Designing a single bandit algorithm that performs nearly as well as the best individual algorithm in a stochastic environment.
method Develops two general corralling algorithms that achieve favorable regret guarantees.
result The regret of the corralling algorithms is no worse than the best individual algorithm's performance.

The exchange algorithm is studied for its convergence and asymptotic variance.

problem Theoretical limitations of the exchange algorithm in sampling from doubly-intractable distributions.
method Theoretical analysis of the exchange algorithm's convergence speed and asymptotic variance.
result The exchange algorithm converges at a geometric rate and satisfies a Central Limit Theorem.

Improves algorithm selection for thousands of candidates using dyadic features.

problem Selecting the best algorithm from a large set of candidates for specific problems.
method Proposes extreme algorithm selection (XAS) with dyadic feature representation.
result Improves significantly over current state of the art in various metrics.

Algorithm design is a laborious process and often requires many iterations of ideation and validation. In this paper, we explore automating algorithm design and present a method to learn an optimization algorithm, which we believe to be the first method that can automatically discover a better algorithm. We approach th…

2016-06-06abs ↗pdf ↗

Paper proposes a reinforcement learning framework for efficient hyper-parameter tuning of stochastic optimization algorithms.

problem Efficient tuning of hyper-parameters for stochastic optimization algorithms.
method Modeling hyper-parameter tuning as a Markov decision process and using policy gradient algorithms.
result The proposed framework significantly reduces the time required for hyper-parameter tuning compared to Bayesian optimization.

New algorithms reduce bilevel optimization complexity to ε^(-1.5).

problem Efficiently solving bilevel optimization problems in machine learning.
method Proposed two new algorithms: one using momentum-based recursive iterations, the other using recursive gradient estimations.
result Achieved computational complexity of ε^(-1.5), significantly faster than previous methods.