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

115229344458 · Jun 202019922001200920172026
48 results for cost-effectiveness analysis

Bayesian model for cost-effectiveness analysis with subgroup discovery.

problem Statistical challenges in cost-effectiveness analysis, especially with non-random treatment assignment and censored data.
method Developed a nonparametric Bayesian model using Dirichlet and Gamma processes to estimate cost-survival distributions and identify cost-effectiveness subgroups.
result Identified and estimated policy-relevant causal CEA estimands using a Bayesian nonparametric g-computation procedure.

The paper develops a method to optimize individualized treatment rules for cost-effectiveness.

problem Developing cost-effective individualized treatment rules for healthcare policy.
method Using conditional random forest and net-monetary-benefit (NMB) to estimate optimal CE-ITR.
result The approach optimizes healthcare resource allocation by maximizing health gains and minimizing costs.

Score calibration enables automatic speaker recognizers to make cost-effective accept / reject decisions. Traditional calibration requires supervised data, which is an expensive resource. We propose a 2-component GMM for unsupervised calibration and demonstrate good performance relative to a supervised baseline on NIST…

2013-11-04abs ↗pdf ↗

We propose a cost-effective framework for preference elicitation and aggregation under the Plackett-Luce model with features. Given a budget, our framework iteratively computes the most cost-effective elicitation questions in order to help the agents make a better group decision. We illustrate the viability of the fram…

2018-05-14abs ↗pdf ↗

Improved distributed learning with reduced communication costs.

problem Efficient communication in resource-constrained environments for distributed learning.
method Proposed a cost-effective partial communication protocol.
result Communication cost is reduced to O(logT)O(\log T), improving significantly on full communication.

IAL uses interactive learning to improve model performance with minimal human feedback.

problem Overfitting and high human interaction cost in training neural networks.
method IAL framework with NAP attention generator and reranking algorithm.
result IAL significantly outperforms baselines with less retraining and human interaction.

CoE modularizes LLMs for scalable, cost-effective AI systems.

problem Challenges in scalability, cost, and customization of monolithic LLMs.
method Composition of Experts (CoE) leverages multiple expert LLMs with a router for dynamic selection.
result CoE achieves superior performance with reduced computational overhead and cost.

CEGA addresses GNN security by enabling cost-effective model acquisition.

problem Vulnerability of Graph Neural Networks (GNNs) to model extraction attacks (MEAs).
method Proposes an adaptive node querying strategy to refine node selection over multiple learning cycles.
result Demonstrates superior performance in accuracy, fidelity, and F1 score under strict query-size constraints.

Statistical test evaluates if personalizing interventions is cost-effective.

problem Balancing the benefits of personalizing interventions with their potential costs.
method Developed a statistical hypothesis test to assess the performance of personalized interventions.
result The test shows that personalized interventions can outperform standard approaches under certain conditions.

Deep convolutional neural networks have achieved great success in various applications. However, training an effective DNN model for a specific task is rather challenging because it requires a prior knowledge or experience to design the network architecture, repeated trial-and-error process to tune the parameters, and …

2018-02-15abs ↗pdf ↗

ComEx protocol reduces communication costs in cooperative bandits.

problem Minimizing communication costs in cooperative bandits while maintaining optimal performance.
method Developed ComEx protocol to reduce communication from Θ(T)Θ(T) to O(logT)O(\log T) messages.
result Achieves state-of-the-art performance with significantly reduced communication cost.

A cost-effective approach to label acquisition using active learning markets.

problem Improving model fitting and training for predictive analytics.
method Formalizing market clearing as an optimisation problem, integrating budget constraints and improvement thresholds, using two active learning strategies with distinct pricing mechanisms.
result Superior performance with fewer labels acquired compared to conventional methods.

We develop a sparse representation method for neural network uncertainty.

problem Estimating model uncertainty in neural networks.
method Sparse representation of model uncertainty using inverse Multivariate Normal Distribution (MND), with a novel sparsification algorithm and analytical sampler.
result The information form of neural networks can be effectively applied for model uncertainty representation, showing competitive performance.

Subsidized insurance reduces poverty by providing social benefits and lowering government costs.

problem Reducing poverty through effective social protection mechanisms.
method Modeling household capital dynamics under four insurance frameworks (uninsured, insured, insured with subsidies, insured with flexible premiums) to assess poverty reduction and governmental costs.
result Subsidized insurance schemes provide maximum social benefits while reducing governmental costs, effectively reducing poverty.

Efficiently estimates material parameter space with multifidelity Gaussian process modeling.

problem Estimating a region of material parameter space with similar precipitate shapes.
method Multifidelity Gaussian process modeling to reduce computational cost.
result Significant reduction in sampling cost for accurate LER estimation.

REMAL: Residual Equilibrium Manifold Active Learning for Surrogate-Based Multidisciplinary Design Analysis

problem Multidisciplinary design analysis of coupled engineering systems requires solving equilibrium states where all disciplinary coupling variables are consistent.
method Residual manifold surrogate modeling framework for coupled systems.
result REMAL learns a surrogate model of the joint residual manifold via multitask Gaussian process models.

This paper reviews and analyzes various modeling approaches for financial index tracking.

problem Efficient replication of market index performance in financial markets.
method Categorization into three frameworks: optimization, statistical, and machine learning; empirical study on S&P 500 dataset.
result Optimization-based models deliver the most precise index tracking, statistical-based models achieve the strongest return-risk balance, and data-driven models provide competitive performance.

This paper uses deep generative models to create synthetic financial data for portfolio and risk modeling.

problem Challenges in empirical research due to privacy, accessibility, and reproducibility issues in financial data.
method Investigates the use of Time-series Generative Adversarial Networks (TimeGAN) and Variational Autoencoders (VAEs) to generate synthetic financial return series.
result Synthetic data from TimeGAN closely mimics real financial data in distributional shapes, volatility, and autocorrelation.

A cost-effective method to generate high-resolution images using wavelet-based super-resolution.

problem High compute resources required for training state-of-the-art image generation models.
method Wavelet-based two-step training framework: low-frequency sampling followed by super-resolution.
result Achieves FID of 10.59 on ImageNet 512x512 with half the compute of BigGAN.

Paper proposes an active learning method for surgical workflow recognition using long-range temporal dependency.

problem Challenges in automatic surgical workflow recognition due to lack of large-scale labelled datasets.
method NL-RCNet with non-local block for capturing long-range temporal dependency and intra-clip dependency score for selection.
result Our approach outperforms state-of-the-art methods by selecting only 50% of samples for training.

Bayesian optimization adapted for experiments with changing environmental conditions.

problem Optimizing experiments influenced by uncontrollable environmental factors.
method Extends Bayesian optimization to handle both controllable and uncontrollable parameters, fitting a global surrogate model and optimizing only controllable parameters conditionally on measurements of uncontrollable variables.
result The proposed ENVBO algorithm finds solutions for the full domain of the environmental variable more efficiently and cost-effectively than traditional methods.

Efficient method for training deep learning models with human validation and statistical analysis.

problem Challenges in labeling medical images for deep learning, including time and cost.
method Four-step method using automated data and human visual checks for iterative refinement and statistical validation.
result Initial model accuracy improved from 92% to 98% with statistical validation.

This paper investigates how machine learning APIs change over time and proposes an efficient method to monitor these changes.

problem Understanding and assessing changes in machine learning APIs over time.
method Systematic investigation of ML API shifts, proposing a principled adaptive sampling algorithm (MASA) for efficient estimation of confusion matrix shifts.
result MASA can accurately estimate confusion matrix shifts using up to 90% fewer samples compared to random sampling.

As machine learning algorithms enter applications in industrial settings, there is increased interest in controlling their cpu-time during testing. The cpu-time consists of the running time of the algorithm and the extraction time of the features. The latter can vary drastically when the feature set is diverse. In this…

2012-06-27abs ↗pdf ↗

Efficiently allocate budgets for LLM-assisted virtual screening to reduce costs.

problem Reducing the cost of evaluating alternatives in large-scale screening tasks.
method Propose a top-mm greedy evaluation mechanism and the EFG-mm algorithm for efficient budget allocation.
result Prove that EFG-mm is both sample-optimal and consistent in large-scale virtual screening.