New approach for open ad hoc teamwork using graph-based policy learning.
problem Designing autonomous agents to collaborate with changing teams without prior coordination.
method Graph-based policy learning to adapt to dynamic team compositions.
result Successfully models the effects of other agents, leading to robust adaptation and superior performance.
SCQRNN prevents quantile crossing and improves computational efficiency.
problem Quantile crossing issue in regression models.
method Integrates ad hoc sorting in training to prevent quantile crossing and enhance computational efficiency.
result SCQRNN achieves faster convergence and non-intersecting quantiles.
Recent advances in smart cities applications enforce security threads such as node replication attacks. Such attack is take place when the attacker plants a replicated network node within the network. Vehicular Ad hoc networks are connecting sensors that have limited resources and required the response time to be as lo…
AHEAD improves financial market efficiency through ad-hoc auctions.
problem Improving financial market efficiency and reducing transaction costs.
method Introducing a new matching design (AHEAD) for electronic markets where participants can trade at a fixed price and trigger auctions when unsatisfied.
result A Nash equilibrium is achieved in the market, and ad-hoc auctions are more relevant and efficient than periodic auctions and continuous limit order books.
Optimal channel assignment in ad hoc networks with heterogeneous users.
problem Optimal allocation of channels in a decentralized network with unknown and varying channel characteristics.
method Developed algorithms for explore-and-commit and logarithmic regret, leveraging specific user transmissions and sensing.
result Achieved near-optimal allocation with high probability and logarithmic regret, significantly outperforming state-of-the-art methods.
Algorithm for stable allocation in heterogeneous ad-hoc networks.
problem Decentralized spectrum allocation in dynamic, heterogeneous networks.
method Multi-armed bandit based distributed algorithm for static and dynamic networks.
result Achieves stable orthogonal allocation in finite time with low complexity.
AD-HOC simplifies high-order derivative calculations in C++.
problem Efficiently computing high-order derivatives in C++.
method A C++ package that calculates derivatives of arbitrary order without code generation.
result Derivatives of arbitrary order computed in a single pass.
Post-hoc calibration of neural networks using g-Layers proves theoretical justification.
problem Ensuring the confidence of neural network decisions in real-world applications.
method Proves theoretical justification for post-hoc calibration methods by adding g-Layers and minimizing NLL.
result Proves that adding g-Layers and minimizing NLL can lead to a calibrated network.
FCDD improves image anomaly detection without post-hoc explainers.
problem Image anomaly detection, especially pixel-wise.
method Fully Convolutional Data Description (FCDD) directly addresses anomaly detection without post-hoc methods.
result FCDD achieves state-of-the-art results on pixel-wise AD tasks.
Enhances deep neural networks with fixed-mean Gaussian processes for uncertainty estimation.
problem Post-hoc uncertainty estimation of pre-trained deep neural networks.
method Fixed-mean Gaussian processes with variational inference for efficient stochastic optimization.
result FMGP improves uncertainty estimation and computational efficiency compared to state-of-the-art methods.
Proposes TgNN-LD to improve neural network effectiveness and efficiency.
problem Limits in maintaining tradeoff between data and domain knowledge.
method Converts loss function to constrained form with PDEs, ECs, and EK as constraints, incorporating Lagrangian variables for equitable tradeoff.
result Improves prediction accuracy and conserves resources.
Objective: Modelling the associations from high-throughput experimental molecular data has provided unprecedented insights into biological pathways and signalling mechanisms. Graphical models and networks have especially proven to be useful abstractions in this regard. Ad-hoc thresholds are often used in conjunction wi…
Machine learning suffers from poor design, data, and evaluation practices.
problem Ad hoc design, poor data hygiene, and lack of statistical rigor in model evaluation.
method Examines the entire machine learning process from design to evaluation, highlighting common pitfalls and providing recommendations.
result Common pitfalls in machine learning research and development are identified and actionable recommendations are provided.
New method for estimating gradients in stochastic binary networks.
problem Challenges in training neural networks with binary activations and weights.
method Combines sampling and analytic approximation steps to estimate gradients accurately.
result Significantly reduced variance at the cost of small bias, leading to practical tradeoffs.
Novel method estimates CV-based classifier performance variance.
problem Lack of rigorous variance estimation methods for CV-based classifiers.
method Influence Function (IF) approach to estimate variance of CV-based estimators.
result IF-based method shows small RMS error with some bias, but ad-hoc methods still perform better.
New insights into training deep networks with low rank layers.
problem Efficiency in training deep neural networks.
method Analysis of techniques for training in low rank space.
result Falsified common beliefs in training deep networks.
Adapts agent strategies on-the-fly for better cross-play in cooperative settings.
problem Cross-play issues between self-play agents and unseen partners.
method Adapts agent strategies using posterior belief updates via Gibbs sampling.
result Achieves strong cross-play in the Hanabi game without prior knowledge of partners' strategies.
CollaQ improves multi-agent performance in StarCraft by 40% with fewer samples.
problem Limited generalization and high training rounds in multi-agent reinforcement learning.
method Formulates multi-agent collaboration as joint optimization on reward assignment, decomposes Q-function into self and interactive terms, and uses MARA loss.
result Improves win rate by 40% in StarCraft maps with same number of samples compared to state-of-the-art techniques.
Deep learning predicts M&A events in industry networks.
problem Predicting M&A behaviors in competitive industries with complex interdependencies.
method Temporal Dynamic Industry Network (TDIN) model using temporal point processes and deep learning.
result Effective M&A event prediction and actionable recommendations.
Powerful generative models, particularly in Natural Language Modelling, are commonly trained by maximizing a variational lower bound on the data log likelihood. These models often suffer from poor use of their latent variable, with ad-hoc annealing factors used to encourage retention of information in the latent variab…
Machine learning methods have found many applications in Raman spectroscopy, especially for the identification of chemical species. However, almost all of these methods require non-trivial preprocessing such as baseline correction and/or PCA as an essential step. Here we describe our unified solution for the identifica…
Automates kernel discovery for longitudinal data analysis.
problem Handling irregularly sampled, sparse longitudinal data with multilevel correlation.
method Combines deep neural networks and non-parametric kernel methods to discover complex multilevel correlation structure.
result Significantly outperforms state-of-the-art methods on benchmark data sets.
Neural network solves inverse problem in multiscale mechanics.
problem Identifying elastic properties of random materials.
method Artificial neural networks trained on processed databases.
result Robust identification method validated with synthetic and real data.
Small intrinsic scale reveals network structure.
problem Understanding the scale at which network identity is revealed.
method Defined intrinsic scale as distinguishability of subgraphs in random walks.
result Intrinsic scale is surprisingly small (7-20 vertices) across various networks.
Enhances functional classifier performance with new tree-based methods and unbiased feature importance assessment.
problem Challenges of high-dimensional functional data and biased feature importance assessment.
method Augmented functional classification trees and random forests with ad-hoc conditional permutations for unbiased feature importance.
result Significant enhancement in predictive power of functional classifiers through new feature importance assessment.
For the past few years, Deep Neural Network (DNN) robustness has become a question of paramount importance. As a matter of fact, in sensitive settings misclassification can lead to dramatic consequences. Such misclassifications are likely to occur when facing adversarial attacks, hardware failures or limitations, and i…
This short note contains an explicit proof of the Jacobi identity for variational Schouten bracket in Z2-graded commutative setup. For the reasoning to be rigorous, it refers to the product bundle geometry of iterated variations (see arXiv:1312.1262 [math-ph]); no ad hoc regularizations occur anywhere in this theory…
Meta-Cal improves post-hoc calibration of neural networks.
problem Improving the accuracy of uncalibrated neural network predictions.
method Meta-Cal uses a base calibrator and a ranking model with constraints to provide high-probability bounds.
result Meta-Cal significantly outperforms existing methods in post-hoc multi-class classification calibration.
Successful recurrent models such as long short-term memories (LSTMs) and gated recurrent units (GRUs) use ad hoc gating mechanisms. Empirically these models have been found to improve the learning of medium to long term temporal dependencies and to help with vanishing gradient issues. We prove that learnable gates in a…
End-to-end method improves neural network calibration during training.
problem Improving neural network calibration for regression problems.
method Quantile Recalibration Training integrates post-hoc calibration into model training.
result Improved predictive accuracy and calibration in a large-scale experiment.
Local network community detection aims to find a single community in a large network, while inspecting only a small part of that network around a given seed node. This is much cheaper than finding all communities in a network. Most methods for local community detection are formulated as ad-hoc optimization problems. In…
Optimizes graph spectral density learning for large networks.
problem Ad-hoc kernel function and bandwidth selection in graph spectral techniques.
method Maximum Entropy approach to learn a smooth graph spectral density.
result Outperforms comparable iterative spectral approaches on synthetic and real graphs.
Improves conditional distribution modeling with simpler training.
problem Analyzing inverse problems with invertible neural networks.
method Uses normalizing flows to maximize posterior likelihood, incorporating conditioning.
result Easier training and natural framework for conditional generation.
New method selects neural network architectures without needing data.
problem Choosing efficient deep neural network architectures.
method Developed the deep frame potential to quantify network capacity.
result Deep frame potential correlates with generalization error.
New method calibrates deep networks by preserving top-k predictions.
problem Calibrated confidence scores for multi-class deep networks to avoid rare mistakes.
method Intra order-preserving functions combined with neural network architecture.
result Outperforms state-of-the-art methods in evaluation metrics.
BSF algorithm reduces neural network size and selects features efficiently.
problem Neural network size and feature selection optimization.
method Binary Stochastic Filtering (BSF) layer that penalizes information, stochastically passes or drops features.
result Multifold decrease in neural network size and optimal feature selection.
The Epps effect helps distinguish between continuous and discrete financial tick data.
problem Determining whether financial tick data represents continuous or discrete events.
method Deriving and correcting the Epps effect, proposing experiments to discriminate between models.
result Tick data is better represented as discrete events rather than continuous Brownian diffusions.
We consider normal almost contact structures on a Riemannian manifold and, through their associated sections of an ad-hoc twistor bundle, study their harmonicity, as sections or as maps. We rewrite these harmonicity equations in terms of the Riemann curvature tensor and find conditions relating the harmonicity of the a…
Cooperative model disentangles data uncertainties.
problem Disentangling aleatoric and epistemic uncertainties in real-world data.
method Cooperatively trains a variance estimation network with a Bayesian neural network.
result Improves mean estimation and disentangles uncertainties.
A number of recent papers have provided evidence that practical design questions about neural networks may be tackled theoretically by studying the behavior of random networks. However, until now the tools available for analyzing random neural networks have been relatively ad-hoc. In this work, we show that the distrib…
There are several (mathematical) reasons why Dupire's formula fails in the non-diffusion setting. And yet, in practice, ad-hoc preconditioning of the option data works reasonably well. In this note we attempt to explain why. In particular, we propose a regularization procedure of the option data so that Dupire's local …
Recent studies show overparameterized neural networks behave like convex systems.
problem Understanding the behavior of overparameterized neural networks.
method Analysis of two-layer neural networks, focusing on restricted settings and neural tangent kernel space.
result Overparameterized neural networks behave like convex systems under certain conditions.
Aux-Net model handles dynamic systems with inconsistent inputs.
problem Inconsistent or unreliable input data in real-world scenarios.
method Aux-Net uses a weighted ensemble of classifiers and online gradient descent.
result Aux-Net provides scalable and agile online learning for dynamic systems.
Reintroduces straight-through estimators for binary neural networks.
problem Training neural networks with binary weights and activations is challenging due to gradient issues and discrete weight optimization.
method Derives ST methods as estimators in the SBN model, analyzes properties and estimation accuracy, explains latent weights and mirror descent method.
result Reintroduces ST methods as sound approximations and provides clearer application and improvements.
According to theoretical models of valuing risky corporate securities, risk of default is primary component in overall yield spread. However, sizable empirical literature considers it otherwise by giving more importance to non-default risk factors. Current study empirically attempts to provide relative solution to this…
Automated multi-task learning algorithm that optimizes network topology.
problem Over-sharing in multi-task learning leads to over-generalization and suboptimal performance.
method Tree-structured design space with gumbel-softmax sampling for differentiable network splitting.
result End-to-end trainable algorithm that optimizes network topology for multiple objectives across tasks.
Large-scale distributed training of deep neural networks suffer from the generalization gap caused by the increase in the effective mini-batch size. Previous approaches try to solve this problem by varying the learning rate and batch size over epochs and layers, or some ad hoc modification of the batch normalization. W…
Post-hoc calibration improves uncertainty under domain shift.
problem Improving uncertainty calibration under domain shift.
method Apply perturbations to validation set before post-hoc calibration.
result Perturbation step results in better calibration under domain shift.