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,657 papers · 148 categories

Trend · papers per month

1122 · Nov 201719922001200920172026
32 results for cost-based

Paper tackles regression with cost-based rejection, balancing prediction and rejection costs.

problem Regression with cost-based rejection, balancing prediction and rejection costs in a continuous target space.
method Formulated expected risk, derived Bayes optimal solution, proposed surrogate loss function.
result Bayes optimal solution can be recovered by the proposed surrogate loss function.

A new active learning method considers both uncertainty and diversity to minimize labeling and decision costs.

problem Classical AL approaches fail to capture data distribution in unlabeled data, leading to mislabeling of outliers.
method CBAL considers classification uncertainty and instance diversity, using a min-max approach to minimize labeling and decision costs.
result Extensive experiments show CBAL outperforms state-of-the-art AL approaches.

In this paper we address cardinality estimation problem which is an important subproblem in query optimization. Query optimization is a part of every relational DBMS responsible for finding the best way of the execution for the given query. These ways are called plans. The execution time of different plans may differ b…

2017-11-22abs ↗pdf ↗

For several decades, the no-arbitrage (NA) condition and the martingale measures have played a major role in the financial asset's pricing theory. We propose a new approach for estimating the super-replication cost based on convex duality instead of martingale measures duality: Our prices will be expressed using Fenche…

2018-07-12abs ↗pdf ↗

Recent attempts to achieve fairness in predictive models focus on the balance between fairness and accuracy. In sensitive applications such as healthcare or criminal justice, this trade-off is often undesirable as any increase in prediction error could have devastating consequences. In this work, we argue that the fair…

2018-05-30abs ↗pdf ↗

We propose a family of relaxations of the optimal transport problem which regularize the problem by introducing an additional minimization step over a small region around one of the underlying transporting measures. The type of regularization that we obtain is related to smoothing techniques studied in the optimization…

2019-06-07abs ↗pdf ↗

Traditionally, machine learning algorithms rely on the assumption that all features of a given dataset are available for free. However, there are many concerns such as monetary data collection costs, patient discomfort in medical procedures, and privacy impacts of data collection that require careful consideration in a…

2019-02-19abs ↗pdf ↗

This study compares various superlearner and deep learning architectures (machine-learning-based and neural-network-based) for classification problems across several simulated and industrial datasets to assess performance and computational efficiency, as both methods have nice theoretical convergence properties. Superl…

2017-08-21abs ↗pdf ↗

There are many industrial situations where rods are used to stir a fluid, or where rods repeatedly stretch a material such as bread dough or taffy. The goal in these applications is to stretch either material lines (in a fluid) or the material itself (for dough or taffy) as rapidly as possible. The growth rate of mater…

2010-04-05abs ↗pdf ↗

Cost-effective feature selection improves network model choice.

problem Selecting informative features from noisy candidates in network models.
method Adapted feature selection methods to account for feature costs and used pilot simulations.
result Reduced computational cost by two orders of magnitude without sacrificing model accuracy.

A framework previously introduced in [3] for solving a sequence of stochastic optimization problems with bounded changes in the minimizers is extended and applied to machine learning problems such as regression and classification. The stochastic optimization problems arising in these machine learning problems is solved…

2019-04-04abs ↗pdf ↗

New algorithms optimize time series classification speed and accuracy.

problem Efficiently classify time series data quickly without sacrificing accuracy.
method Optimization criterion balancing misclassification and delay costs, derived non-myopic algorithms.
result Supervised-based algorithms outperform unsupervised-based ones in real data sets.

Machine learning predicts Bitcoin returns but trading performance drops with costs.

problem Trading Bitcoin predictions with transaction costs.
method XGBoost, LSTM, iTransformer models evaluated in walk-forward protocol; cost-aware execution filter implemented.
result Cost-aware execution filter restores profitability; XGBoost strategy outperforms.

Paper studies fundamental limits of communication in distributed learning.

problem Communication efficiency in model aggregation for distributed learning.
method Rate-Distortion approach to model aggregation as a vector Gaussian CEO problem.
result Derives rate region bound and sum-rate-distortion function for model aggregation.

Study optimizes stock portfolios using network analysis and forecasting.

problem Optimizing stock portfolios with network analysis and forecasting.
method Constructs dependency networks using VAR and FEVD, applies MST algorithm, and incorporates ARIMA and NNAR forecasts.
result MST-based strategies outperform buy-and-hold benchmarks, achieving higher returns.

Imbalanced data with a skewed class distribution are common in many real-world applications. Deep Belief Network (DBN) is a machine learning technique that is effective in classification tasks. However, conventional DBN does not work well for imbalanced data classification because it assumes equal costs for each class.…

2018-04-28abs ↗pdf ↗

Graphlets are defined as k-node connected induced subgraph patterns. For an undirected graph, 3-node graphlets include close triangle and open triangle. When k = 4, there are six types of graphlets, e.g., tailed-triangle and clique are two possible 4-node graphlets. The number of each graphlet, called graphlet count, i…

2018-10-07abs ↗pdf ↗

Active learning suffers from biased non-response, which this paper addresses.

problem Active learning's effectiveness is compromised by biased non-response in real-world contexts.
method Proposes a cost-based correction to the sampling strategy, UCB-EU, to mitigate the impact of biased non-response.
result UCB-EU successfully reduces the harm from labelling non-response in many settings.

Study on newsvendor problem with censored data, showing how much information is lost.

problem Minimizing costs in a newsvendor problem with limited historical demand data.
method Distributionally robust optimization framework, evaluating policies based on worst-case regret.
result Characterization of information loss due to demand censoring and development of a robust algorithm.

Quantum algorithm speeds up MIP solving by a near-quadratic factor.

problem Solving Mixed Integer Programs (MIPs) efficiently.
method Incremental-Quantum-Branch-and-Bound algorithm combining quantum speedup with classical search heuristics.
result Universal near-quadratic speedup over classical Branch-and-Bound algorithms.