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

8.3%16.7%25.0%33.3% · Jul 199219922001200920172026
48 results for Total Classification Cost

Method minimizes total cost of classification by acquiring covariates efficiently.

problem Minimizing total cost of classification in applications with covariate acquisition costs.
method Formalizes optimization goal using Bayes risk, introduces assumptions for computable solution.
result Proposed method achieves lowest total costs compared to previous methods on medical datasets.

Improves classifier evaluation by aligning with Total Classification Cost.

problem Lack of consensus on evaluation metrics and class imbalance issues.
method Introduces Weighted Accuracy (WA) and a reweighting framework for cost-sensitive scenarios.
result WA aligns with Total Classification Cost (TCC) minimization under realistic conditions.

Germany's tax admin costs likely exceed 20% of total revenue, requiring system improvement.

problem High tax administrative costs in Germany and other jurisdictions.
method Statistical data, surveys, and a novel approach to measure total administrative cost as a percentage of total tax revenue.
result Germany's 2021 tax administrative costs likely exceeded 20% of total tax revenue.

New method reduces total cost constraints in CBwK to sqrt(T) with fairness application.

problem Maximize rewards while adhering to total cost constraints in CBwK.
method Dual strategy based on projected-gradient-descent updates.
result Total cost constraints reduced to sqrt(T) with poly-logarithmic terms.

Spatially-sparse predictors are good models for brain decoding: they give accurate predictions and their weight maps are interpretable as they focus on a small number of regions. However, the state of the art, based on total variation or graph-net, is computationally costly. Here we introduce sparsity in the local neig…

2016-06-21abs ↗pdf ↗

New classifications of totally real surfaces in nearly Kähler C⁴.

problem Classifying totally real surfaces in nearly Kähler C⁴.
method Investigation under various assumptions, including extrinsic homogeneity, minimality, total umbilicity, and Codazzi-like properties.
result Multiple new examples of totally real surfaces, including parallel and non-parallel Codazzi-like cases.

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 ↗

A novel algorithm reduces communication costs in federated best arm identification.

problem Identifying the best arm in a federated multi-armed bandit setup with minimal communication cost.
method Proposes a novel algorithm called FedElim that communicates only in exponential time steps.
result Demonstrates that communication is almost cost-free in FedElim, with a total cost at most 3 times the maximum under its variant.

Paper introduces a new project control method using Monte Carlo and statistical learning.

problem Project control under uncertainty.
method Integrates Earned Value Methodology with Monte Carlo simulation and statistical learning.
result Estimates probabilities of project success and duration.

New method quantifies uncertainty at class level for better decision-making.

problem Improving cost-sensitive decision-making in classification tasks.
method Label-wise decomposition of uncertainty measures based on non-categorical metrics.
result Proposed measures adhere to desirable properties and improve uncertainty quantification.

Max-min margin Markov networks improve consistency in structured prediction.

problem Statistical inconsistency in max-margin methods for structured prediction.
method Defining a max-min margin formulation to overcome statistical inconsistency.
result Proves consistency and provides an explicit algorithm with finite sample generalization bounds.

In this article, relations between the root space decomposition of a Riemannian symmetric space of compact type and the root space decompositions of its totally geodesic submanifolds (symmetric subspaces) are described. These relations provide an approach to the classification of totally geodesic submanifolds in Rieman…

2006-03-07abs ↗pdf ↗

In the first part of this expository article, the most important constructions and classification results concerning totally geodesic submanifolds in Riemannian symmetric spaces are summarized. In the second part, I describe the results of my classification of the totally geodesic submanifolds in the Riemannian symmetr…

2008-10-24abs ↗pdf ↗

In this paper, we study a risk process modeled by a Brownian motion with drift (the diffusion approximation model). The insurance entity can purchase reinsurance to lower its risk and receive cash injections at discrete times to avoid ruin. Proportional reinsurance and excess-of-loss reinsurance are considered. The obj…

2011-12-17abs ↗pdf ↗

Optimizing rewards under budget constraints with correlated costs and rewards.

problem Maximizing total expected reward under a budget constraint on total cost with correlated and potentially heavy-tailed cost-reward pairs.
method Proposes algorithms exploiting correlation between cost and reward via linear minimum mean-square error estimation to achieve tight regret bounds.
result Achieves O(logB)O(\log B) regret for a budget B>0B>0 under certain moment conditions.

The study classifies certain types of incomplete surfaces with low curvature.

problem Classifying incomplete affine spheres with specific curvature constraints.
method Analyzing total curvature and asymptotic behavior of surfaces.
result New examples of incomplete affine spheres with positive genus found.

SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.

problem Classifying hyperspectral images with limited labeled data.
method Shape-adaptive Reconstruction (SaR) for pixel preprocessing, SVM for probability estimation, and Smoothed Total Variation (STV) for denoising.
result SaR-SVM-STV outperforms SVM-STV with fewer labeled data.

Buying or selling assets leads to transaction costs for the investor. On one hand, it is well know to all market practionaires that the transaction costs are positive on average and present therefore systematic loss. On the other hand, for every trade, there is a buy side and a sell side, the total amount of asset and …

2011-03-11abs ↗pdf ↗

A novel method for classification with rejection using ensemble of cost-sensitive classifiers.

problem Avoid risky misclassification in error-critical applications.
method Learning an ensemble of cost-sensitive classifiers.
result Improved classification accuracy and flexibility in loss selection.

Embedded minimal surfaces of finite total curvature in R3\mathbb{R}^3 are reasonably well understood: From far away, they look like intersecting catenoids and planes, suitably desingularized. We consider the larger class of harmonic embeddings in R3\mathbb{R}^{3} of compact Riemann surfaces with finitely many punctures…

2014-07-10abs ↗pdf ↗

Paper proposes a method to estimate project cost contingency reserves considering various types of uncertainty.

problem Inaccurate estimation of project cost contingency reserves due to ignoring different types of uncertainty.
method Quantitative determination of project cost contingency reserves using Monte Carlo Simulation considering aleatoric, stochastic, and epistemic uncertainties.
result The proposed method provides more accurate contingency reserves that align with actual project risks.

The law of total probability may be deployed in binary classification exercises to estimate the unconditional class probabilities if the class proportions in the training set are not representative of the population class proportions. We argue that this is not a conceptually sound approach and suggest an alternative ba…

2013-12-02abs ↗pdf ↗

The cost-sensitive classification problem plays a crucial role in mission-critical machine learning applications, and differs with traditional classification by taking the misclassification costs into consideration. Although being studied extensively in the literature, the fundamental limits of this problem are still n…

2018-05-20abs ↗pdf ↗

Classifies totally geodesic submanifolds in symmetric spaces.

problem Classifying submanifolds in symmetric spaces.
method Classification of totally geodesic submanifolds in products of rank one symmetric spaces.
result Infinitely many examples of irreducible totally geodesic submanifolds in Hermitian symmetric spaces.

The paper classifies totally geodesic Lagrangian submanifolds in a specific pseudo-nearly Kähler space.

problem Understanding Lagrangian submanifolds in pseudo-nearly Kähler spaces.
method Examining four classes of submanifolds based on their behavior with respect to an almost product structure, then classifying totally geodesic ones.
result A complete classification of totally geodesic Lagrangian submanifolds in the pseudo-nearly Kähler SL(2,R)imesSL(2,R)\mathrm{SL}(2,\mathbb{R}) imes\mathrm{SL}(2,\mathbb{R}).