Analyzes various methods to compare portfolio performance, explaining why simple choices can outperform sophisticated ones.
problem Explains why simple portfolio choices can outperform more complex ones.
method Examines several comparison criteria for portfolios, including those on the market line and in the absence of a risk-free asset.
result Clarifies why some portfolios may seem to outperform others, providing theoretical insights.
Simple heuristics can outperform sophisticated methods in high-dimensional pattern recognition.
problem Quantifying the difficulty of high-dimensional pattern recognition problems.
method Classification benchmarks based on simple random projection heuristics.
result Optimal classification curves asymptotes indicate no structural advantage over simple heuristics.
Study naive vs sophisticated agents stopping a diffusion process with time-inconsistent payoffs.
problem Time-inconsistent stopping problem for diffusion processes.
method Analyzes naive and sophisticated agents' strategies, proving equilibrium existence.
result Equilibrium strategies can be derived as fixed points of strategic reasoning operators.
Proposes SOVR loss to improve adversarial robustness by increasing logit margins.
problem Adversarial training's difficulty in robustness against sophisticated attacks.
method Introduces SOVR loss function that switches from cross-entropy to one-vs-the-rest loss for important samples.
result SOVR loss increases logit margins of important samples, improving robustness against Auto-Attack.
AdamQLR optimizes Adam with K-FAC heuristics, achieving comparable performance to tuned benchmarks.
problem Improving the performance of Adam optimizers with stabilizing heuristics.
method Combining Adam's update directions with K-FAC's heuristics (damping and learning rate selection).
result Untuned AdamQLR can achieve comparable performance to tuned benchmarks.
ARL uses queries to learn rewards, focusing on cost vs. reward value.
problem How to efficiently use queries to learn rewards in reinforcement learning.
method Proposed and evaluated heuristic approaches for ARL in multi-armed bandits and MDPs.
result Challenging aspects of ARL highlighted, including intractability of value computation.
In this paper, we explore and detail our experiments in a high-dimensionality, multi-class image classification problem often found in the automatic recognition of Sign Languages. Here, our efforts are directed towards comparing the characteristics, advantages and drawbacks of creating and training Support Vector Machi…
Proposes a heuristic to dynamically control exploration vs exploitation in Bayesian optimization.
problem The trade-off between exploration and exploitation in Bayesian optimization methods.
method Contextual Improvement heuristic to dynamically control the trade-off.
result Improves the speed and robustness of discovering optimal solutions.
Conditional modeling x \to y is a central problem in machine learning. A substantial research effort is devoted to such modeling when x is high dimensional. We consider, instead, the case of a high dimensional y, where x is either low dimensional or high dimensional. Our approach is based on selecting a small subset y_…
FinCARE combines financial data and AI reasoning to improve causal analysis of financial performance.
problem Correlation-based analysis fails to capture true causal relationships in financial performance.
method Hybrid framework integrating causal discovery algorithms with financial domain knowledge from SEC filings and LLM reasoning.
result KG+LLM-enhanced methods improve causal discovery across PC, GES, and NOTEARS by 36-366%.
Simple policy outperforms complex ones in cloud auto-scaling.
problem Predicting resource scaling for large-scale cloud applications with limited deployment throughput.
method Probabilistic workload forecast for auto-scaling decisions based on risk aversion.
result The proposed policy outperforms sophisticated and simple benchmark policies in real-world and synthetic data.
Improved stock selection through predictive fundamentals and uncertainty estimates.
problem Selecting stocks based on future financial data to outperform traditional factor models.
method Train deep nets to forecast future fundamentals, incorporate uncertainty estimates, and adjust portfolios to manage risk.
result Simulated annualized return of 17.7% and Sharpe ratio of 0.84 for uncertainty-aware model, significantly higher than 14.0% and 0.52 for standard factor models.
New loss function improves classification for imbalanced and sensitive groups.
problem Optimizing metrics like balanced error and equal opportunity in imbalanced and sensitive classification.
method Developed a principled vector-scaling (VS) loss function that addresses multiplicative adjustments necessary at terminal training phase.
result The VS loss function improves minority class performance and generalizes to different types of imbalances.
Extends PCVM for multi-class classification with improved accuracy.
problem Lack of probabilistic outputs and contradictory predictions in multi-class classification.
method Proposes mPCVM with two learning algorithms: top-down and bottom-up.
result Superior performance, especially with many classes, validated on synthetic and benchmark data.
Deep learning matches classical feature-based AS models for TSP.
problem Automated selection of algorithms for the TSP.
method Evolved instances, deep neural network, visual representation.
result Deep learning approach matches classical feature-based models.
Proposes proactive bed requests to reduce ED boarding and patient wait times.
problem Reduces ED boarding and patient wait times by proactively requesting inpatient beds.
method Formulates as a Markov decision process, uses predictions of admission probability and time to disposition to guide bed requests.
result Proactive aggregate bed requests can reduce boarding times by 30-70% and length of stay by 6-15%.
Study optimizes portfolio liquidation strategies with complex market impacts.
problem Optimizing portfolio liquidation with transient market impacts and self-exciting order flow.
method Mean-field control problem with semimartingale strategies, passing to continuous-time limit, and solving Riccati equations.
result Existence of optimal strategy with jumps only at start and end of trading period.
Simple regularization fixes easy detection of adversarial attacks.
problem Detecting adversarial machine learning attacks.
method Added a regularization term to the attacker's objective function.
result Regularization makes adversarial attacks detectable with simple methods.
DataRater learns which data points are most valuable for training models.
problem Training model efficiency depends on high-quality training data.
method Meta-learning to estimate the value of data points for training.
result Meta-learning improves compute efficiency by filtering data effectively.
VR game data for P300 BCI with raccoon vs demon stimuli.
problem Developing confidence metrics for P300 BCI.
method Multiclass labeled P300 dataset in VR game context.
result Estimation of model's confidence in stimulus predictions.
The paper compares clustering methods for improving time series forecasting accuracy.
problem Improving time series forecasting accuracy using neural networks.
method Investigates feature-based and distance-based clustering methods for time series forecasting.
result Feature-based clustering outperforms distance-based clustering in terms of speed and efficiency.
AI methods often fail to outperform classical CPU-based solvers on Maximum Independent Set problems.
problem Comparing AI methods with classical CPU-based solvers on Maximum Independent Set problems.
method Comparison of AI methods (e.g., generative models, reinforcement learning) with classical CPU-based solvers (e.g., KaMIS) on Maximum Independent Set problem.
result AI-inspired methods are often outperformed by classical CPU-based solvers, even with post-processing techniques.
Single autoregressive model outperforms ensemble methods in offline reinforcement learning.
problem Offline reinforcement learning with limited data and model errors.
method Infer system dynamics from data and optimize policies on model rollouts, using a single autoregressive model.
result Single autoregressive model achieves better performance than ensembles on the D4RL benchmark.
Achilles predicts Gold vs USD with a profitable trading bot.
problem Accurate and consistent prediction of commodity prices.
method LSTM neural network for minute-by-minute predictions.
result $1623.52 profit in 23 days of testing.
This review compares extractive and abstractive summarization methods.
problem Improving abstractive summarization in natural language processing.
method Compared various approaches including supervised and unsupervised methods, deep learning, and NLP.
result Current research uses combinations of approaches, but abstractive summarization remains unsolved.
Invasive interventions did not significantly shorten ICU patients' time to death.
problem Determining if withholding or withdrawing invasive interventions affects ICU patients' time to death.
method Observational study using MIMIC-III ICU database, stratifying by severity, comparing 2002-2005 vs. 2008-2011.
result Despite a reduction in invasive interventions, time to death did not decrease.
Kernel interpolation improved with continuous volume sampling.
problem Approximating functions from RKHS using weighted sums of kernel translates.
method Continuous volume sampling for choosing node locations.
result Proved almost optimal bounds for interpolation and quadrature under VS.
A new framework improves reinforcement learning algorithms with policy guarantees.
problem Designing efficient and stable reinforcement learning algorithms.
method A general framework (FMA-PG) based on functional mirror ascent that constructs surrogate functions enabling policy improvement guarantees.
result The proposed framework enables policy improvement guarantees that hold regardless of policy parameterization, and recovers important heuristics.
Study reveals investor behavior in NFT bubbles.
problem Understanding retail investor behavior in asset bubbles.
method Systematic study of NFTs using public blockchain data.
result Sophisticated investors outperform others in NFT bubbles.
Framework for pricing data products in data-poor markets.
problem Challenges in pricing advanced data products due to lack of transaction data.
method Prior-predictive Monte Carlo framework for generating probabilistic price bands.
result Stable probabilistic price bands for data products in data-poor markets.
Sophisticated volatility models outperform naive portfolio strategies.
problem Improving mean-variance portfolio performance over the naive 1/N strategy.
method Investigated various econometric and portfolio models across multiple datasets.
result Most models achieve higher Sharpe ratios and lower portfolio volatility than the naive rule.
Global and local blowups of manifolds are proven equivalent.
problem Equivalence of global and local blowups in differential topology.
method Proof of equivalence between global and local constructions of blowups.
result Global and local constructions of blowups are shown to be equivalent.
New algorithms parallelize all-in-one SVM training, improving text classification accuracy.
problem Training all-in-one SVMs is computationally infeasible for many classes.
method Developed distributed algorithms for two all-in-one SVM formulations.
result Superior accuracy on text classification data compared to one-vs.-rest SVMs.
Differential privacy enables organizations to collect accurate aggregates over sensitive data with strong, rigorous guarantees on individuals' privacy. Previous work has found that under differential privacy, computing multiple correlated aggregates as a batch, using an appropriate \emph{strategy}, may yield higher acc…
DSNC learns binary codes for multi-class classification with sublinear inference.
problem High inference complexity in one-vs-all methods for large multi-class classification.
method DSNC learns binary codes and mappings end-to-end without a priori tuning.
result DSNC achieves sublinear inference complexity and outperforms baselines.
Automates data augmentation by learning from user-specified transformations.
problem Manual construction and tuning of complex data transformations for state-of-the-art results.
method Generative adversarial model over user-specified transformations trained on unlabeled data.
result Improves accuracy on CIFAR-10, ACE relation extraction, and medical imaging datasets.
We price weather-contingent options by use of Monte Carlo simulations. After calibrating the models to fit quoted prices, we analyze bid-ask spreads in terms of correlations across markets. Results are presented for a double-trigger Weather vs. Natural Gas call option.
Study on investment strategy for agents with periodic preferences and discounting.
problem Investment decisions by agents with periodic S-shaped preferences and present bias.
method Infinite-horizon, continuous-time portfolio selection problem with quasi-hyperbolic discounting.
result Time-consistent planning strategy can be formulated as an equilibrium to a static mean field game.
New evaluation scheme shows existing methods are unreliable for out-of-distribution detection.
problem Evaluating out-of-distribution samples in deep learning models.
method Introducing OD-test, a three-dataset evaluation scheme.
result Existing methods are unreliable for real-world applications of high-dimensional images.
Proposes Nash averaging to improve evaluation in machine learning.
problem Overwhelming choices in evaluation suites and attacks have diluted the basic model.
method Detailed analysis of evaluation scenarios leads to Nash averaging, which adapts to data redundancies.
result Nash averaging encourages maximally inclusive evaluation, reducing bias.
Rejoinder on slope heuristics for model selection in regression.
problem Model selection in least-squares fixed-design regression with biased models and general noise.
method Proves the slope heuristics works even with significant bias and computes expectations for Gaussian noise.
result The slope heuristics is valid even when models are biased and noise has a general dependence structure.
The paper introduces isotropy as a regularizer to enhance portfolio stability.
problem Model uncertainty and estimation errors in diversification strategies.
method Integrates isotropy as a geometric regularizer into mean-variance optimization.
result Isotropy constraint systematically induces negative average-signal exposure, providing a robust crash hedge.
Simple models outperformed sophisticated ones in forecasting Turkish lira exchange rates.
problem Forecasting Turkish lira exchange rates through univariate techniques.
method Used several models including simple exponential smoothing to predict daily exchange rates.
result Simple exponential smoothing model outperformed all other alternatives.
Boosting models improve pediatric ICU transfer prediction.
problem Predicting transfer of pediatric patients to ICU.
method Adaptive and gradient boosting classifiers combined into an ensemble model.
result Improved accuracy, sensitivity, specificity, and AUROC over baseline.
We present Vector-Space Markov Random Fields (VS-MRFs), a novel class of undirected graphical models where each variable can belong to an arbitrary vector space. VS-MRFs generalize a recent line of work on scalar-valued, uni-parameter exponential family and mixed graphical models, thereby greatly broadening the class o…
A new method learns link prediction heuristics from local subgraphs using GNN.
problem Link prediction in network-structured data.
method Developed a novel γ-decaying heuristic theory and a GNN-based algorithm to learn heuristics from local subgraphs.
result Unprecedented performance in link prediction across various problems.
Proposes a method to imitate active learning heuristics for better performance.
problem The performance of active learning heuristics depends on the classifier model and data structure.
method Imitates the selection of the best active learning heuristic using DAGGER.
result Outperforms state-of-the-art imitation learners and heuristics on well-known datasets.
The paper revisits discriminative vs. generative classifiers, showing naive Bayes requires fewer samples.
problem Comparing discriminative and generative classifiers in multiclass settings.
method Theoretical analysis and simulations of naive Bayes vs. logistic regression.
result Multiclass naive Bayes requires fewer samples to approach asymptotic error compared to logistic regression.