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 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.
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.
Model shows different trading behaviors during financial crisis.
problem Understanding trading dynamics during financial crises.
method Implemented a market microstructure model with informed, uninformed, and heuristic-driven traders.
result Heuristic-driven trading remains constant during financial crisis, while informed trading varies.
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.
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.
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.
The paper introduces a new language for semi-supervised learning tasks.
problem Handling semi-supervised learning with declarative constraints.
method Developed a declarative language for modeling both supervised and semi-supervised learning tasks, including heuristics and combining multiple heuristics.
result Improved performance on relation-extraction tasks for real-world domains.
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.
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.
Improves heuristics for routing problems using attention models.
problem Improving heuristics for combinatorial optimization problems, especially for routing problems.
method Proposed a model based on attention layers and trained it using REINFORCE with a simple greedy rollout.
result Significantly improved results for TSP and other routing problems, close to optimal or specialized algorithms.
A new heuristic for learning Markov network structure efficiently.
problem Complications in learning Markov networks, especially intractable computations and large parameter space.
method A computationally tractable greedy heuristic to limit the number of parameters.
result The method performs comparably well to state-of-the-art methods on real datasets.
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.
Survey on minimal penalty algorithms and slope heuristics.
problem Choosing optimal multiplicative constants from data.
method Minimal penalty and slope heuristics approach.
result Slope heuristics performs almost as well as residual-based estimators.
Coral infers generative model structure from code heuristics.
problem Lack of labeled data for complex generative models.
method Static code analysis to infer model structure without ground truth labels.
result Sample complexity scales quasilinearly with heuristics and relations found.
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.
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 predicts player retention in mobile games quickly.
problem Predicting player retention in free-to-play mobile games.
method Heuristic modeling to build simple retention prediction rules.
result Heuristic approach achieves comparable performance to common algorithms.
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.
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.
Declarative entropy constraints improve semi-supervised learning.
problem Improving semi-supervised learning performance.
method Declarative specification of entropy constraints for semi-supervised learning.
result Consistent improvements on SSL benchmarks, including a new state-of-the-art result.
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.
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.
This paper optimizes portfolio rebalancing under uncertain security returns using meta-heuristic algorithms.
problem Optimizing portfolio rebalancing under uncertain security returns with transaction costs.
method Meta-heuristic algorithms (genetic algorithm) for solving the portfolio rebalancing problem.
result Meta-heuristic algorithms provide better results than global optimization solvers for portfolio rebalancing under uncertainty.
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.
The paper analyzes why the median heuristic works well in kernel methods.
problem Lack of theoretical understanding of the median heuristic's effectiveness.
method Convergence analysis and empirical investigations of kernel two-sample test.
result The median heuristic leads to asymptotic normality of bandwidth in kernel two-sample test.
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%.
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.
Neuro# learns heuristics to speed up #SAT solvers.
problem Efficiently solving #SAT problems for large industrial instances.
method Learning branching heuristics to improve #SAT solver performance.
result Neuro# reduces step count and wall-clock time on diverse problem families.
Empirical analysis of deep learning heuristics like learning rate restarts and distillation.
problem Understanding the effectiveness and mechanisms of deep learning heuristics.
method Loss surface and representation analysis methods (mode connectivity and CCA) for empirical analysis.
result Learning rate warmup prevents training instability in deeper layers, and cosine annealing does not explain success.
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.
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. 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.
Dynamic classifier chains improve multi-label classification efficiency.
problem Building efficient multi-label classification models.
method Dynamic ensemble of chain classifiers using Naive Bayes and nearest neighbor approaches, with heuristic for label order optimization.
result The proposed dynamic chain model based on Naive Bayes classifier and heuristic is efficient for multi-label classification.
A new model tracks indices without rebalancing, solving NP-hard problems.
problem Tracking indices without rebalancing and minimizing deviations.
method Metaheuristic algorithms and local branching for solving mixed integer linear programming.
result The heuristic generates portfolios that outperform commercial solvers in both in-sample and out-of-sample 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.
New methods show less biased link prediction than traditional heuristics.
problem Systematic biases in link prediction methods.
method Comparison of heuristic and graph embedding based methods.
result Graph embedding methods show less biased results than heuristics.
The paper uses Column Generation for faster construction of binary decision trees.
problem Constructing efficient univariate binary decision trees for classification tasks.
method Proposes an Integer Linear Programming (ILP) formulation and solves it via Column Generation based heuristic.
result The approach is competitive with state-of-the-art ILP-based algorithms and can handle large datasets.
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.
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…
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…
Study combines A* and DNN for better pathfinding.
problem Limited applicability of A* in domains without good heuristics.
method Trains a DNN to represent heuristic for A* and integrates it.
result Significantly better performance in driving simulation.
L3Ms fine-tune LLMs with constraints for tailored applications.
problem Inadequate alignment of LLMs for diverse applications.
method Formulate SFT and alignment as constrained optimization, using logarithmic barriers.
result Versatile and effective in achieving tailored alignments for various applications.
A new clustering method combines Kalman filtering with K-Means for better results.
problem Improving clustering efficiency and accuracy in data mining.
method Proposes a new clustering algorithm (HKA-K) that integrates Kalman filtering and K-Means.
result HKA-K outperforms other hybrid meta-heuristic clustering approaches on UCI datasets.
Framework for multi-agent RL with human feedback in a Snake game.
problem Improving multi-agent reinforcement learning with human feedback.
method Developed a simulated game environment for offline model training and online competitions. Introduced HILL methods and reward manipulation heuristics.
result Agents with HILL methods outperform those without in online competitions.
Heuristic tool estimates lactate threshold for easier training decisions.
problem Improving lactate threshold estimation for recreational runners.
method Formalized lactate threshold principles, iterative methodology, heuristic approach.
result Heuristic %60 of 'endurance running speed reserve' is reliable and accessible.
We present an efficient algorithm for the inference of stochastic block models in large networks. The algorithm can be used as an optimized Markov chain Monte Carlo (MCMC) method, with a fast mixing time and a much reduced susceptibility to getting trapped in metastable states, or as a greedy agglomerative heuristic, w…
The paper develops algorithms for Boolean matrix factorization using IP and heuristics.
problem Approximating binary input matrices as products of smaller binary factors.
method Alternating optimization with integer programming and greedy/local-search heuristics.
result Proposed methods improve scalability and performance compared to existing techniques.