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.
The report evaluates heuristics for learning timescale graphical event models.
This paper evaluates heuristics and hyperparameters in weight-sharing NAS methods.
This research evaluates and introduces new heuristics for clustering Bitcoin blockchain entities.
This paper evaluates algorithms for classification and outlier detection accuracies in temporal data. We focus on algorithms that train and classify rapidly and can be used for systems that need to incorporate new data regularly. Hence, we compare the accuracy of six fast algorithms using a range of well-known time-ser…
We develop theory for using heuristics to solve computationally hard problems in differential privacy. Heuristic approaches have enjoyed tremendous success in machine learning, for which performance can be empirically evaluated. However, privacy guarantees cannot be evaluated empirically, and must be proven --- without…
Proposes a new PBO method with theoretical guarantees.
A new algorithm improves efficiency and robustness of heuristic optimization in simulation-based problems.
New saliency evaluations focus on completeness and soundness, improving explanations.
Optimizes fund portfolio updates using linear programming and heuristic search.
AdamQLR optimizes Adam with K-FAC heuristics, achieving comparable performance to tuned benchmarks.
Recently, several authors have advocated the use of rule learning algorithms to model multi-label data, as rules are interpretable and can be comprehended, analyzed, or qualitatively evaluated by domain experts. Many rule learning algorithms employ a heuristic-guided search for rules that model regularities contained i…
Learning how to automatically solve optimization problems has the potential to provide the next big leap in optimization technology. The performance of automatically learned heuristics on routing problems has been steadily improving in recent years, but approaches based purely on machine learning are still outperformed…
New estimator reduces bias-variance tradeoff in Markovian interference experiments.
RLSbench benchmarks domain adaptation under label proportion shifts, revealing widespread failures and proposing a two-step meta-algorithm.
The aim of black-box optimization is to optimize an objective function within the constraints of a given evaluation budget. In this problem, it is generally assumed that the computational cost for evaluating a point is large; thus, it is important to search efficiently with as low budget as possible. Bayesian optimizat…
CriticSMC improves planning efficiency in constrained environments.
UAV enabled communications and networking can enhance wireless connectivity and support emerging services. However, this would require system-level understanding to modify and extend the existing terrestrial network infrastructure. In this paper, we integrate UAVs both as user equipment and base stations into existing …
ARL uses queries to learn rewards, focusing on cost vs. reward value.
The paper discovers and evaluates support and resistance levels in financial time series.
Bayesian optimization has emerged as a strong candidate tool for global optimization of functions with expensive evaluation costs. However, due to the dynamic nature of research in Bayesian approaches, and the evolution of computing technology, using Bayesian optimization in a parallel computing environment remains a c…
DPDP combines neural heuristics with DP for vehicle routing problems.
Proposes proactive bed requests to reduce ED boarding and patient wait times.
PackIt creates a virtual space for testing geometric planning skills.
The study provides theoretical foundations for using smaller instances to predict algorithm performance on larger ones.
The use of automatic methods, often referred to as Neural Architecture Search (NAS), in designing neural network architectures has recently drawn considerable attention. In this work, we present an efficient NAS approach, named HM- NAS, that generalizes existing weight sharing based NAS approaches. Existing weight shar…
Taleb (2018) claimed a novel approach to evaluating the quality of probabilistic election forecasts via no-arbitrage pricing techniques and argued that popular forecasts of the 2016 U.S. Presidential election had violated arbitrage boundaries. We show that under mild assumptions all such political forecasts are arbitra…
We look at the meaning of 'relaxation' in the wealth exchange models that are recently proposed in Econophysics to interpret the wealth distributions. To quantify and characterise the process of relaxation, we define an appropriate quantity and evaluate that numerically for the systems of many agents. Also, the numeric…
We present a heuristic based algorithm to induce \textit{nonmonotonic} logic programs that will explain the behavior of XGBoost trained classifiers. We use the technique based on the LIME approach to locally select the most important features contributing to the classification decision. Then, in order to explain the mo…
Market sectors play a key role in the efficient flow of capital through the modern Global economy. We analyze existing sectorization heuristics, and observe that the most popular - the GICS (which informs the S&P 500), and the NAICS (published by the U.S. Government) - are not entirely quantitatively driven, but rather…
This paper studies the evaluation of policies that recommend an ordered set of items (e.g., a ranking) based on some context---a common scenario in web search, ads, and recommendation. We build on techniques from combinatorial bandits to introduce a new practical estimator that uses logged data to estimate a policy's p…
This text is the rejoinder following the discussion of a survey paper about minimal penalties and the slope heuristics (Arlot, 2019. Minimal penalties and the slope heuristics: a survey. Journal de la SFDS). While commenting on the remarks made by the discussants, it provides two new results about the slope heuristics …
Proposes a method to imitate active learning heuristics for better performance.
Combines k-means and hill climbing for stratification and allocation.
Link prediction is a key problem for network-structured data. Link prediction heuristics use some score functions, such as common neighbors and Katz index, to measure the likelihood of links. They have obtained wide practical uses due to their simplicity, interpretability, and for some of them, scalability. However, ev…
TAROT improves data selection for complex multimodal distributions.
Nemo improves WS learning pipeline by 20%.
Interactive weak supervision learns useful heuristics from user feedback.
New method estimates model performance bounds without ground truth labels.
This paper investigates recently proposed approaches for defending against adversarial examples and evaluating adversarial robustness. We motivate 'adversarial risk' as an objective for achieving models robust to worst-case inputs. We then frame commonly used attacks and evaluation metrics as defining a tractable surro…
We propose a general approach to modeling semi-supervised learning (SSL) algorithms. Specifically, we present a declarative language for modeling both traditional supervised classification tasks and many SSL heuristics, including both well-known heuristics such as co-training and novel domain-specific heuristics. In ad…
Microarray cancer gene expression data comprise of very high dimensions. Reducing the dimensions helps in improving the overall analysis and classification performance. We propose two hybrid techniques, Biogeography - based Optimization - Random Forests (BBO - RF) and BBO - SVM (Support Vector Machines) with gene ranki…
We implement a market microstructure model including informed, uninformed and heuristic-driven investors, which latter behave in line with loss-aversion and mental accounting. We show that the probability of informed trading (PIN) varies significantly during 2008. In contrast, the probability of heuristic-driven tradin…
Paper optimizes urban navigation with deep learning models.
New heuristics for predicting links in multiplex networks.
In this paper is proposed a new heuristic approach belonging to the field of evolutionary Estimation of Distribution Algorithms (EDAs). EDAs builds a probability model and a set of solutions is sampled from the model which characterizes the distribution of such solutions. The main framework of the proposed method is an…
Recently two search algorithms, A* and breadth-first branch and bound (BFBnB), were developed based on a simple admissible heuristic for learning Bayesian network structures that optimize a scoring function. The heuristic represents a relaxation of the learning problem such that each variable chooses optimal parents in…
Finding the optimal -means clustering is NP-hard in general and many heuristics have been designed for minimizing monotonically the -means objective. We first show how to extend Lloyd's batched relocation heuristic and Hartigan's single-point relocation heuristic to take into account empty-cluster and single-poin…
New method improves BO's AF maximizer initialization for high-dimensional problems.