Study counts simple knots with specific Alexander polynomials, suggesting asymptotic formula.
problem Counting simple knots with specific Alexander polynomials.
method Classification of simple knots, algebraic and arithmetic formulations, Cohen-Lenstra heuristics, sieve methods.
result Asymptotic formula for the count of simple knots, with prime contributions bounded.
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.
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.
This research evaluates and introduces new heuristics for clustering Bitcoin blockchain entities.
problem Efficiently analyzing the vast number of Bitcoin blockchain entities.
method Examined and introduced four new heuristics for clustering Bitcoin blockchain entities.
result Introduced clustering ratio to measure heuristic effectiveness.
RLHO uses RL to generate better initial solutions for heuristic optimization.
problem High sample complexity in generating initial solutions for combinatorial optimization problems.
method RLHO framework that augments heuristic algorithms with RL to generate better initial solutions.
result RLHO outperforms baseline methods on bin packing problem.
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…
Nemo improves WS learning pipeline by 20%.
problem Creating effective labeling heuristics for weak supervision.
method Interactive procedure for designing heuristics, strategic data selection, contextualization of heuristics.
result Improves WS learning pipeline by 20%.
This paper evaluates heuristics and hyperparameters in weight-sharing NAS methods.
problem Improving the performance of weight-sharing NAS methods.
method Systematic evaluation of heuristics and hyperparameters in weight-sharing NAS algorithms.
result Some heuristics negatively impact super-net and stand-alone performance correlation.
Interactive weak supervision learns useful heuristics from user feedback.
problem Creating useful heuristics for large labeled datasets is tedious and subjective.
method Develops an interactive framework for learning heuristics from user feedback.
result Only a few feedback iterations are needed to train models without ground truth labels.
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…
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…
The report evaluates heuristics for learning timescale graphical event models.
problem Lack of heuristics for determining hyper-parameters in timescale graphical event models.
method Proposed and evaluated different heuristics for hyper-parameter determination and refined an existing distance measure.
result Conclusions about the applicability of different heuristics on synthetic data.
New heuristics for predicting links in multiplex networks.
problem Link prediction in networks with multiple types of connections.
method Proposed a general framework and three families of heuristics.
result Significantly outperformed baseline heuristics for ordinary networks.
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 k-means clustering is NP-hard in general and many heuristics have been designed for minimizing monotonically the k-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…
Bayesian symbolic regression automates model discovery from data.
problem Learning closed-form mathematical models from data using heuristic methods.
method Probabilistic approach to symbolic regression, connecting to information theory and statistical physics.
result Probabilistic approach provides model plausibility and performance guarantees.
This work explores the non-convex optimization in compressive learning and the performance of heuristics.
problem The challenge of learning from compressed representations in compressive learning.
method Numerical simulations of the non-convex optimization landscape and heuristic performance.
result Properties of the non-convex optimization landscape and heuristic performance are explored.
In kernel methods, the median heuristic has been widely used as a way of setting the bandwidth of RBF kernels. While its empirical performances make it a safe choice under many circumstances, there is little theoretical understanding of why this is the case. Our aim in this paper is to advance our understanding of the …
Heuristic weighting improves denoising score matching without requiring noise distribution assumptions.
problem Improving denoising score matching without assuming noise distribution.
method Demonstrated heteroskedasticity, derived optimal weighting functions, and provided theoretical and empirical comparisons.
result Heuristical weighting function can achieve lower variance than optimal weighting, facilitating more stable and efficient training.
We propose a technique for declaratively specifying strategies for semi-supervised learning (SSL). The proposed method can be used to specify ensembles of semi-supervised learning, as well as agreement constraints and entropic regularization constraints between these learners, and can be used to model both well-known h…
Two heuristics solve dynamic multiple travelling salesmen problems.
problem Dynamic routing with unknown customers.
method Balanced dynamic closest vehicle heuristic and balanced dynamic assignment vehicle heuristic.
result Continuous approximation models for strategic dynamic routing.
Deep RL learns 2-opt heuristics to improve TSP solutions.
problem Improving TSP solutions beyond initial heuristics.
method Deep reinforcement learning to learn 2-opt operations.
result Learned policies improve solutions faster than previous methods.
A* is a popular path-finding algorithm, but it can only be applied to those domains where a good heuristic function is known. Inspired by recent methods combining Deep Neural Networks (DNNs) and trees, this study demonstrates how to train a heuristic represented by a DNN and combine it with A*. This new algorithm which…
Graphical heuristic reduces and partitions large datasets for faster supervised training.
problem Training large datasets for classification tasks.
method Clustering and information graph construction for dataset reduction and partitioning.
result Significant speed-up in training run-time without compromising prediction accuracy.
New heuristics improve genetic programming's parent selection for classification problems.
problem Improving genetic programming's parent selection for classification tasks.
method Proposed three heuristics inspired by specific classifiers' characteristics, using similarity measures.
result Combination of agreement-based selection and random selection outperforms classical and state-of-the-art schemes.
Clustering algorithms have regained momentum with recent popularity of data mining and knowledge discovery approaches. To obtain good clustering in reasonable amount of time, various meta-heuristic approaches and their hybridization, sometimes with K-Means technique, have been employed. A Kalman Filtering based heurist…
RL improves combinatorial optimization by automating heuristic search.
problem Hard combinatorial optimization problems with suboptimal solutions.
method Training RL agents to solve these problems.
result RL can outperform traditional algorithms in solving complex problems.
This paper tackles minimizing clipped convex functions with heuristics and mixed-integer convex programming.
problem Minimizing a sum of clipped convex functions.
method Heuristics and mixed-integer convex programming.
result Heuristics can find good solutions, and the perspective transformation yields tractable lower bounds.
This paper investigates Shampoo's heuristics and decouples preconditioner updates.
problem Improving Shampoo's heuristics for training neural networks.
method Decomposing preconditioner updates, correcting eigenvalues, and adapting eigenbasis computation frequency.
result Principled techniques to remove Shampoo's heuristics and improve training algorithms.
This work explores how to balance rule consistency and coverage for multi-label classification.
problem Balancing rule consistency and coverage for effective multi-label classification.
method Empirical study of rule learning heuristics in multi-label classification.
result The choice of heuristic for multi-label classification is crucial and depends on the performance measure.
Developed Forex trading heuristics with high profit potential.
problem Reduced trade opportunities due to technical indicator values.
method Machine learning simulation of 10 years of Forex data.
result Optimized trade parameters for 118 pips daily profit.
New approach improves black-box planning efficiency by discovering focused macros.
problem Difficulty of deterministic planning increases exponentially with depth.
method Discovering macro-actions with focused effects to improve goal-count heuristics.
result Focused macros dramatically improve black-box planning efficiency.
Decision tree learning heuristics fail even in smoothed analysis for complex targets.
problem Greedy decision tree learning heuristics fail for complex target functions in the smoothed analysis model.
method Construct counterexamples and analyze the behavior of heuristics in the smoothed setting and agnostic setting.
result Greedy decision tree learning heuristics can build trees of exponential depth before achieving high accuracy for certain complex target functions.
New method detects heuristics in complex game strategies.
problem Understanding decision-making in games with infinite strategy spaces.
method Introducing decoupled strategies to detect convergence towards Nash equilibria.
result Predictive measure ΔD reveals participants' actions with high success rate.
This research develops heuristics to detect CoinJoin transactions on Bitcoin blockchain.
problem Compromised privacy in Bitcoin transactions due to CoinJoin.
method Analyzed open-source CoinJoin implementations to develop heuristics.
result Refined heuristics for identifying CoinJoin transactions on the blockchain.
A new algorithm improves efficiency and robustness of heuristic optimization in simulation-based problems.
problem Optimizing input parameters for stochastic simulation-based optimization.
method Reactive sample size algorithm based on parametric tests and indifference-zone selection.
result The reactive method improves efficiency and robustness of heuristic optimization techniques.
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.
The convergence rate and final performance of common deep learning models have significantly benefited from heuristics such as learning rate schedules, knowledge distillation, skip connections, and normalization layers. In the absence of theoretical underpinnings, controlled experiments aimed at explaining these strate…
New heuristic selects fewer assets for efficient portfolios, reducing costs.
problem High transaction costs and fees from including many assets in portfolios.
method Surrogate formulation to select assets, re-optimizes portfolio with fewer assets.
result Effective in constructing portfolios with fewer assets, reducing costs.
Link prediction is a popular research topic in network analysis. In the last few years, new techniques based on graph embedding have emerged as a powerful alternative to heuristics. In this article, we study the problem of systematic biases in the prediction, and show that some methods based on graph embedding offer le…
Paper presents a probabilistic framework for diffusion synchronization.
problem Improper application of heuristics leads to suboptimal results in diffusion synchronization.
method Develops a probabilistic framework to analyze and adapt correlation models for each specific task.
result Achieves better results by identifying optimal correlation models per task.
Paper shows re-solving heuristics have constant regret for price-based revenue management.
problem Optimal pricing policies for revenue management with time constraints.
method Proves re-solving heuristics have O(1) regret compared to optimal policies. result Improved regret bound to O(1) from O(lnT), complemented by Ω(lnT) gap with fluid model. This paper presents preliminary work on learning the search heuristic for the optimal motion planning for automated driving in urban traffic. Previous work considered search-based optimal motion planning framework (SBOMP) that utilized numerical or model-based heuristics that did not consider dynamic obstacles. Optimal…
GE finds failures in autonomous systems without domain heuristics.
problem Finding failures in autonomous systems without domain-specific heuristics.
method Adaptive stress testing using go-explore (GE) algorithm.
result GE finds failures in scenarios other RL techniques cannot solve.
Learning sentence vectors from an unlabeled corpus has attracted attention because such vectors can represent sentences in a lower dimensional and continuous space. Simple heuristics using pre-trained word vectors are widely applied to machine learning tasks. However, they are not well understood from a theoretical per…
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…
In this paper, we deal with the task of building a dynamic ensemble of chain classifiers for multi-label classification. To do so, we proposed two concepts of classifier chains algorithms that are able to change label order of the chain without rebuilding the entire model. Such modes allows anticipating the instance-sp…
In this work, a heuristic as operational tool to estimate the lactate threshold and to facilitate its integration into the training process of recreational runners is proposed. To do so, we formalize the principles for the lactate threshold estimation from empirical data and an iterative methodology that enables experi…