Improves generative models for cost-sensitive decisions.
problem Generative models lack awareness of decision costs.
method Integrates a decision loss into the training objective.
result Improves cost-sensitive forecast accuracy.
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.
169,042 papers · 148 categories
Trend · papers per month
48 results for “training decision”
Deep learning models generalize by extending decision boundaries outside the convex hull of training data.
problem Understanding how deep learning models generalize beyond their training data.
method Investigation of decision boundaries inside and outside the convex hull of training sets, using various neural network architectures and training regimes.
result Over-parameterization is necessary for deep learning models to extend decision boundaries outside the convex hull of their training data.
Study examines whether biased training data lead to biased algorithms.
problem Tackles the issue of bias in algorithmic decision-making.
method Examines a setting where biased human decision-makers affect training data and labels.
result Clarifies conditions for bias reversal in algorithmic decision rules.
Deep neural networks' decision boundaries move closer to natural images during training.
problem Limited understanding of deep neural networks' decision boundaries and regions.
method Examined the minimum distance of data points to the decision boundary over training.
result The decision boundary moves closer to natural images during training, even in late epochs.
Researchers compute exact decision boundaries of neural networks.
problem Finding exact decision boundaries of trained neural networks is intractable.
method Developed mathematical tools to investigate decision boundaries of trained deep models.
result Some simplifying assumptions about decision boundaries are unreliable.
A scalable method for training prediction models in predict-then-optimize
problem Training prediction models in the predict-then-optimize paradigm
method Decision-focused learning pipeline
result Decision quality competitive with state-of-the-art methods while reducing training time
Study shows how AI model can improve decision-making with missing data.
problem Sequential decision-making with missing covariates.
method Introduced model elasticity to quantify imputation discrepancy; used statistical learning and regression for calibration.
result Calibrating pre-trained models can significantly reduce regret in decision-making.
Study reveals how features influence deep network decision boundaries.
problem Understanding the role of features in neural network decision boundaries.
method Adopted adversarial robustness tools to measure changes in CNN decision boundaries.
result Neural networks exhibit high invariance to non-discriminative features and are sensitive to small perturbations of training samples.
Co-training improves sequential decision-making policies from multiple views.
problem Learning policies in settings with multiple state-action representations.
method Inspired by co-training for classification, we present a co-training framework for sequential decision making.
result Our framework improves upon learning from a single view alone.
Creating impact in real-world settings requires artificial intelligence techniques to span the full pipeline from data, to predictive models, to decisions. These components are typically approached separately: a machine learning model is first trained via a measure of predictive accuracy, and then its predictions are u…
Conventional decision trees have a number of favorable properties, including interpretability, a small computational footprint and the ability to learn from little training data. However, they lack a key quality that has helped fuel the deep learning revolution: that of being end-to-end trainable, and to learn from scr…
Towards Scalable Meta-Learning of near-optimal Interpretable Models via Synthetic Model Generationscs.LG
Meta-learning interpretable decision trees with synthetic data.
problem Lack of efficient, scalable methods for generating synthetic data for decision tree meta-learning.
method Synthetic generation of near-optimal decision trees using the MetaTree transformer architecture.
result Meta-learning of decision trees achieves performance comparable to real-world data or optimal decision trees, with significant computational cost reduction.
Rectified Decision Trees: Exploring the Landscape of Interpretable and Effective Machine Learningcs.LG
Rectified decision trees improve machine learning interpretability and effectiveness.
problem Combining interpretability and effectiveness in machine learning models.
method Knowledge distillation and modified decision tree splitting criteria.
result Soft labels improve model performance and reduce model size.
Deep neural networks have proved to be a very effective way to perform classification tasks. They excel when the input data is high dimensional, the relationship between the input and the output is complicated, and the number of labeled training examples is large. But it is hard to explain why a learned network makes a…
Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.
problem Understanding and optimizing deep learning training phases.
method Direct measurements on three deepnet architectures across seven datasets.
result Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.
Neural models can realize decision trees with parameter sharing and improved performance.
problem Training and optimizing oblique decision trees.
method Locally constant networks based on ReLU gradients, parameter sharing, and neural tools.
result Locally constant networks can implicitly model oblique decision trees with fewer neurons.
Paper proposes using unlabeled data for fair decision-making.
problem Bias in decision-making algorithms due to biased labels and selective labeling.
method Variational autoencoder for learning unbiased data representations from both labeled and unlabeled data.
result Method learns fair and stable decision policies with high utility.
Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningstat.ML
Wasserstein DR optimizes decisions under uncertain distributions.
problem Learning decisions from uncertain data with limited samples.
method Wasserstein distributionally robust optimization (DR) approach.
result Optimal decisions can be computed efficiently and have strong guarantees.
Many recent works on knowledge distillation have provided ways to transfer the knowledge of a trained network for improving the learning process of a new one, but finding a good technique for knowledge distillation is still an open problem. In this paper, we provide a new perspective based on a decision boundary, which…
Framework improves human decision-making by learning representations.
problem Improving human decision-making performance conflated with machine accuracy.
method Mind Composed with Machine framework, incorporating human decision-making model into representation learning.
result Empirically demonstrated successful application to various tasks and representational forms.
L1-orthogonal regularization improves decision tree explainability of deep neural networks.
problem Lack of explainability in deep neural networks.
method L1-orthogonal regularization during training of decision trees.
result Decision trees closely approximate trained deep neural networks with improved accuracy and fidelity.
Mixup reduces the sample complexity of finding optimal decision boundaries for more separable data.
problem Finding optimal decision boundaries in separable data distributions.
method Mixup technique applied to binary linear classification problems.
result Mixup significantly reduces the sample complexity for more separable data.
Decision trees improve decision-making by optimizing predictions of unknown parameters.
problem Optimizing decisions based on predicted unknown parameters.
method SPO Trees (SPOTs) for training decision trees under the SPO loss function.
result SPOTs provide higher quality decisions and significantly lower model complexity compared to other machine learning approaches.
Automated Budget Constrained Training optimizes model training under time constraints.
problem Balancing model quality and computational cost in constrained time.
method Developed a hyperparameter optimisation algorithm that learns the relationship between hyperparameters, model quality, and computational cost.
result The algorithm optimally decides whether to terminate or continue training, and what hyperparameters to use.
A new method for decision-focused learning using diffusion models.
problem Inability of deterministic point predictions to capture stochasticity in real-world environments.
method Proposes a diffusion-based DFL approach that trains a diffusion model to represent uncertain parameters and optimizes decisions through stochastic optimization.
result Empirically shows consistent outperformance over strong baselines in decision quality.
Alternative to convolutions using decision trees for neural networks.
problem Replacing complex convolutions with simpler decision-based layers.
method Binary decisions as indices to conditional distributions, trained using backpropagation.
result Performance similar to conventional neural networks, with runtime improvements.
Decision trees are a popular technique in statistical data classification. They recursively partition the feature space into disjoint sub-regions until each sub-region becomes homogeneous with respect to a particular class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using…
The paper proposes a method to assess and improve data quality using GBDT training dynamics.
problem Improving data quality in datasets with noisy labels and varying contributions.
method Metrics computed from training dynamics of Gradient Boosting Decision Trees (GBDTs).
result The method achieved the best results compared to other approaches.
While deep reinforcement learning has successfully solved many challenging control tasks, its real-world applicability has been limited by the inability to ensure the safety of learned policies. We propose an approach to verifiable reinforcement learning by training decision tree policies, which can represent complex p…
This study explains and mitigates inflated returns and turnover in SPO-based portfolio optimization.
problem Inflated returns and excessive turnover in SPO-based portfolio optimization.
method KKT-based interpretation of portfolio decisions as ranking over adjusted scores, empirical evaluation of stabilization mechanisms.
result Realistic output constraints and portfolio-level turnover control improve SPO-based strategies.
New learning process for neural classifiers simplifies decision weights.
problem Training decision layer weights in neural classifiers.
method Choosing appropriate loss functions and solving constrained optimization problems.
result A new learning process for pre-decision weights that is simple and effective.
Novel loss functions improve decision tree learning from noisy data.
problem Training decision trees with noisy labels.
method Introducing distribution losses and a new negative exponential loss.
result The negative exponential loss leads to efficient and robust decision tree learning.
For using neural networks in safety critical domains, it is important to know if a decision made by a neural network is supported by prior similarities in training. We propose runtime neuron activation pattern monitoring - after the standard training process, one creates a monitor by feeding the training data to the ne…
Proposes ReDT for interpretable, compressed, and robust decision trees.
problem Improving interpretability and performance of decision trees.
method Knowledge distillation with soft labels and multiple cross-validation.
result ReDT achieves fewer nodes than classical decision trees while maintaining good performance and interpretability.
Transformers learn to make decisions in new contexts from offline data.
problem Understanding when and how transformers can perform in-context reinforcement learning.
method Theoretical framework analyzing supervised pretraining for ICRL, including algorithm distillation and decision-pretrained transformers.
result Transformers can efficiently approximate optimal reinforcement learning algorithms for various environments.
A new decision tree method tackles fairness in datasets with missing values.
problem Fairness concerns in machine learning models trained on data with missing values.
method An integrated approach based on decision trees that incorporates missing values directly and optimizes a fairness-regularized objective function.
result Our method outperforms existing fairness intervention methods applied to imputed datasets.
Both neural networks and decision trees are popular machine learning methods and are widely used to solve problems from diverse domains. These two classifiers are commonly used base classifiers in an ensemble framework. In this paper, we first present a new variant of oblique decision tree based on a linear classifier,…
A new method for decision-focused learning reduces computational cost.
problem Efficiently solving combinatorial problems with uncertain parameters.
method Reframed as cost-sensitive multi-output regression, with novel loss components.
result Comparable downstream task quality with reduced computational cost.
A Novel Hyperparameter-free Approach to Decision Tree Construction that Avoids Overfitting by Designcs.LG
A new decision tree method avoids overfitting without hyperparameters.
problem Overfitting in decision trees.
method Hyperparameter-free approach that constructs smaller, shallower trees.
result Avoids overfitting without compromising accuracy or training time.
Simplifies complex RL policies by ranking important decisions.
problem Complexity in RL policies makes them hard to analyze and interpret.
method Statistical fault localisation to rank states and prune unimportant decisions.
result Pruned policies can perform similarly to original policies, improving interpretability.
Improved reasoning model by sampling from power distribution without additional training.
problem Efficiently sampling from a sharpened distribution to improve reasoning models.
method Entropy-Cut Metropolis-Hastings algorithm that identifies key decision points for resampling.
result The method consistently improves reasoning models across various datasets.
The paper explores methods to explain decisions of deep learning models by faithfully reproducing their training data views.
problem Explaining decisions of complex deep learning models trained on large datasets.
method Data view extraction through hill-climbing and GAN-driven approaches, followed by creation of shadow models for explanation.
result Shadow models based on faithfully reproduced data views are effective for explaining decisions of blackbox deep learning models.
In AI research and industry, machine learning is the most widely used tool. One of the most important machine learning algorithms is Gradient Boosting Decision Tree, i.e. GBDT whose training process needs considerable computational resources and time. To shorten GBDT training time, many works tried to apply GBDT on Par…
New online algorithms tackle dynamic decision-focused learning.
problem Dynamic decision-focused learning in evolving environments.
method Regularization and perturbation techniques for non-convex optimization.
result First provable guarantees for online decision-focused learning.
Directional Decision Listsstat.ML
In this paper we introduce a novel family of decision lists consisting of highly interpretable models which can be learned efficiently in a greedy manner. The defining property is that all rules are oriented in the same direction. Particular examples of this family are decision lists with monotonically decreasing (or i…
This study proposes a logic architecture for the high-speed and power efficiently training of a gradient boosting decision tree model of binary classification. We implemented the proposed logic architecture on an FPGA and compared training time and power efficiency with three general GBDT software libraries using CPU a…
Paper proposes fair decision trees to avoid unfair treatment.
problem Discriminative decision-making in automated systems.
method Mixed-integer optimization framework for fair decision trees.
result Improves fairness and accuracy in decision-making.
We introduce canonical correlation forests (CCFs), a new decision tree ensemble method for classification and regression. Individual canonical correlation trees are binary decision trees with hyperplane splits based on local canonical correlation coefficients calculated during training. Unlike axis-aligned alternatives…