BNAS improves neural architecture search with a scalable, fast, and efficient approach.
problem Efficiently searching for optimal neural architectures with high performance and low training time.
method Designing a broad scalable architecture (BCNN) with reinforcement learning and parameter sharing, and developing two variants.
result Significantly reduces training time and achieves state-of-the-art performance on CIFAR-10 and ImageNet.
We introduce scalable deep kernels, which combine the structural properties of deep learning architectures with the non-parametric flexibility of kernel methods. Specifically, we transform the inputs of a spectral mixture base kernel with a deep architecture, using local kernel interpolation, inducing points, and struc…
In this paper, a neural architecture search (NAS) framework is proposed for 3D medical image segmentation, to automatically optimize a neural architecture from a large design space. Our NAS framework searches the structure of each layer including neural connectivities and operation types in both of the encoder and deco…
VQC-MLPNet combines quantum and classical elements for scalable quantum machine learning.
problem Challenges in expressivity, trainability, and noise resilience of VQCs.
method Hybrid architecture with a VQC generating weights for a classical MLP during training.
result Improved expressivity, trainability, and robustness compared to standalone quantum or hybrid approaches.
We propose a new scalable method to optimize the architecture of an artificial neural network. The proposed algorithm, called Greedy Search for Neural Network Architecture, aims to determine a neural network with minimal number of layers that is at least as performant as neural networks of the same structure identified…
Scalable NAS by factorizing operators into subspaces.
problem Scaling up NAS search space while avoiding operator competition.
method Factorizing a large set of candidate operators into smaller subspaces.
result Achieved state-of-the-art performance on CIFAR10 and ImageNet.
BSA-TNP improves NP scalability and accuracy for spatiotemporal data.
problem Scalability and accuracy trade-off in Neural Processes.
method Introduces KRBlocks, group-invariant attention biases, and BSA for scalable spatiotemporal inference.
result BSA-TNP matches or exceeds accuracy of best models while training faster.
Paper introduces scalable neural architecture for solving NP-hard problems.
problem Solving NP-hard reasoning problems from natural inputs.
method Scalable neural architecture and loss function for discrete Graphical Models.
result Empirically shows efficient learning of NP-hard problems.
The practical usage of reinforcement learning agents is often bottlenecked by the duration of training time. To accelerate training, practitioners often turn to distributed reinforcement learning architectures to parallelize and accelerate the training process. However, modern methods for scalable reinforcement learnin…
Kolmogorov-Arnold Networks promise scalable performance in high dimensions.
problem Curse of dimensionality in multilayer perceptrons.
method Kolmogorov-Arnold representation theorem and interpolation methods.
result Kolmogorov-Arnold Networks achieve true freedom from the curse of dimensionality.
LeJEPA provides a scalable, theory-driven approach to self-supervised learning.
problem Lack of practical guidance and theory in JEPAs.
method Identified optimal Gaussian distribution and introduced SIGReg objective.
result LeJEPA achieves state-of-the-art performance with minimal hyperparameters and heuristics.
Coherent Multiplex analyzes real-time wavelet coherence among multiple signals.
problem Identifying and visualizing coherence among multiple time series.
method Fast spectral similarity based on cosine similarity metrics of Fourier-transformed signals and sparse time-frequency wavelet coherence.
result Scalable real-time system for low-latency inference and monitoring of inter-signal relationships.
New neural KB representation speeds up reasoning with large symbolic knowledge bases.
problem Efficiently reasoning with large symbolic knowledge bases.
method Sparse-matrix reified knowledge base, enabling fully differentiable, scalable neural modules.
result Competitive performance on KB completion and semantic parsing benchmarks.
Bio-inspired neuromorphic hardware is a research direction to approach brain's computational power and energy efficiency. Spiking neural networks (SNN) encode information as sparsely distributed spike trains and employ spike-timing-dependent plasticity (STDP) mechanism for learning. Existing hardware implementations of…
EASTER improves OCR efficiency and scalability.
problem Efficient and scalable Optical Character Recognition (OCR) for machine printed and handwritten text.
method 1-D convolutional layers without recurrence, parallel training, synthetic dataset generation.
result EASTER achieves comparable performance to complex RNN models with less data and outperforms them on benchmark datasets.
The paper discusses scalable learning for wireless data-driven systems.
problem Expanding data volume and model complexity limit centralized learning solutions.
method Discusses scalable architecture and local learning strategies.
result Promising research directions in scalable data-driven wireless communications.
To solve the big topic modeling problem, we need to reduce both time and space complexities of batch latent Dirichlet allocation (LDA) algorithms. Although parallel LDA algorithms on the multi-processor architecture have low time and space complexities, their communication costs among processors often scale linearly wi…
New graph representation learning network improves scalability and feature integration.
problem Scalability and feature integration in graph neural networks for large, dense graphs.
method Adaptive sampling of neighbours based on weighted multi-step transition probabilities.
result Comparable or better results on various graph benchmarks.
This paper addresses the scalability challenge of architecture search by formulating the task in a differentiable manner. Unlike conventional approaches of applying evolution or reinforcement learning over a discrete and non-differentiable search space, our method is based on the continuous relaxation of the architectu…
BINAS improves neural architecture search with interpretable models.
problem Finding efficient neural networks under resource constraints.
method BINAS uses a bilinear formulation for accuracy and resource estimation, with a scalable search method.
result BINAS generates comparable or better architectures than state-of-the-art methods, while strictly satisfying resource constraints.
DKL-KAN combines deep learning and kernel methods for scalable, expressive models.
problem Combining deep learning's depth with kernel methods' flexibility for scalable models.
method DKL-KAN uses Kolmogorov-Arnold Networks (KAN) to optimize kernel attributes within a Gaussian process framework.
result DKL-KAN outperforms DKL-MLP on datasets with a low number of observations and DKL-MLP on large datasets.
Scalable method bounds Lipschitz constant of generative models.
problem Bounding the Lipschitz constant of generative models.
method Layerwise convex approximations using zonotopes.
result Efficient and tight bounds on generative models.
A promising class of generative models maps points from a simple distribution to a complex distribution through an invertible neural network. Likelihood-based training of these models requires restricting their architectures to allow cheap computation of Jacobian determinants. Alternatively, the Jacobian trace can be u…
Meta-learning interpretable decision trees with synthetic data.
problem Lack of efficient, scalable methods for generating synthetic data for decision tree meta-learning.
method Synthetic generation of near-optimal decision trees using the MetaTree transformer architecture.
result Meta-learning of decision trees achieves performance comparable to real-world data or optimal decision trees, with significant computational cost reduction.
Efficient graph neural networks for large graphs without sampling.
problem Efficiently learning from large graphs like social networks.
method Inception graph neural networks using scalable graph convolutional filters.
result Significantly faster training and inference times compared to state-of-the-art methods.
Cancer is a complex disease, the understanding and treatment of which are being aided through increases in the volume of collected data and in the scale of deployed computing power. Consequently, there is a growing need for the development of data-driven and, in particular, deep learning methods for various tasks such …
NeuroMAS treats multi-agent systems as neural networks for scalable, trainable coordination.
problem Designing multi-agent systems as hand-designed workflows is inefficient and inflexible.
method NeuroMAS treats multi-agent systems as a neural network architecture with reinforcement learning for scalable coordination.
result NeuroMAS improves significantly over multi-agent baselines and can be scaled progressively.
CogScale benchmarks AI architectures for sequential processing.
problem Evaluating AI architectures' ability to process sequential information efficiently.
method 14 scalable synthetic tasks designed to isolate cognitive and memory abilities at different scales.
result Attention mechanisms and modern state-space models consistently maintain high performance as task difficulty scales.
SpeqNets improve graph neural networks by scaling and adapting to graph sparsity.
problem Graph neural networks struggle with permutation-equivariant functions and scalability to large graphs.
method Introducing sparsity-aware, permutation-equivariant graph networks with heuristics for graph isomorphism.
result Significantly improved predictive performance and reduced computation times compared to existing methods.
Novel neural GP kernels learn stable, flexible covariance structures.
problem Scalable and flexible covariance kernels for Gaussian processes.
method Directly learn kriging coefficients and conditional standard deviations using deep neural architectures exploiting permutation-equivariant structure.
result Improved training stability and data efficiency with expressive, non-stationary kernels.
Graph kernels based on the 1-dimensional Weisfeiler-Leman algorithm and corresponding neural architectures recently emerged as powerful tools for (supervised) learning with graphs. However, due to the purely local nature of the algorithms, they might miss essential patterns in the given data and can only handle binar…
SAFLe solves federated learning's trade-off between non-linearity and scalability.
problem Federated Learning's high communication overhead and performance collapse on non-IID data.
method SAFLe introduces a structured head of bucketed features and sparse, grouped embeddings, mathematically equivalent to a high-dimensional linear regression.
result SAFLe achieves a new state-of-the-art in analytic FL, outperforming linear AFL and multi-round DeepAFL.
ABI adapts to graph data for fast, scalable inference.
problem Challenges in inference on graph-structured data.
method Amortized Bayesian Inference (ABI) framework for graph data.
result ABI successfully addresses challenges in graph data inference.
New theory maps neural network weights to optimize faster and scale.
problem Optimizing neural networks for speed and scalability.
method Constructing a duality map using layer-wise operator norms.
result Derived GPU-friendly algorithms for various layers.
One of the key technologies for future large-scale location-aware services covering a complex of multi-story buildings --- e.g., a big shopping mall and a university campus --- is a scalable indoor localization technique. In this paper, we report the current status of our investigation on the use of deep neural network…
The paper explores how structured representations influence learning dynamics in neural networks.
problem Understanding the training dynamics of deep neural networks.
method Investigates a family of enriched transformation layers with constrained pathways and adaptive corrections.
result Improved robustness, smoother optimization, and scalable depth behavior are achieved through structured representations.
The 2018 Grand Challenge targets the problem of accurate predictions on data streams produced by automatic identification system (AIS) equipment, describing naval traffic. This paper reports the technical details of a custom solution, which exposes multiple tuning parameters, making its configurability one of the main …
Node Masking improves GNNs' scalability and generalization.
problem Improving GNNs' ability to handle arbitrary graphs.
method Introducing Node Masking to enhance GNNs' performance.
result Node Masking enables GNNs to generalize and scale better.
In this paper, we present iPrescribe, a scalable low-latency architecture for recommending 'next-best-offers' in an online setting. The paper presents the design of iPrescribe and compares its performance for implementations using different real-time streaming technology stacks. iPrescribe uses an ensemble of deep lear…
New method learns subspace affinity function for scalable and inductive clustering.
problem Scaling and inductiveness of self-expressiveness methods for high-dimensional data.
method Siamese neural network architecture for metric learning.
result Model scales to larger datasets and clusters out-of-sample data.
HardCoRe-NAS finds fitting neural networks adhering to hard resource constraints.
problem Finding fitting neural networks that adhere to hard resource constraints.
method Accurate formulation of resource requirement and scalable search method.
result HardCoRe-NAS generates state-of-the-art architectures strictly satisfying hard resource constraints.
Bayesian optimisation with graph kernels improves neural architecture search and provides interpretability.
problem Lack of insight into why architectures perform well and how to improve them.
method Combines Bayesian optimisation with Weisfeiler-Lehman graph kernels for highly data-efficient and interpretable architecture search.
result Demonstrates state-of-the-art performance on closed- and open-domain search spaces.
New architectures improve topological deep learning's ability to capture complex data features.
problem Current TDL architectures struggle with fundamental topological and metric invariants.
method Developed multi-cellular networks (MCN) and scalable MCN (SMCN) to enhance expressivity.
result SMCN outperforms HOMP and expressive graph methods in learning topological properties.
Neural Architecture Search (NAS) has been quite successful in constructing state-of-the-art models on a variety of tasks. Unfortunately, the computational cost can make it difficult to scale. In this paper, we make the first attempt to study Meta Architecture Search which aims at learning a task-agnostic representation…
Graph neural networks learn decentralized controllers from data.
problem Finding optimal decentralized controllers for autonomous agents is challenging.
method Adapting graph neural networks to handle delayed communications and ensure scalability and transferability.
result Graph neural networks can learn decentralized controllers from data, addressing the scalability and practical implementation issues of centralized controllers.
Deep neural-kernel models combine neural networks and kernel machines for scalable large datasets.
problem Combining neural networks and kernel machines for efficient large-scale learning.
method Hybrid neural-kernel architecture using explicit feature mapping and pooling layers.
result The deep neural-kernel models are effective and scalable on benchmark datasets.
Remarkable achievements have been attained by deep neural networks in various applications. However, the increasing depth and width of such models also lead to explosive growth in both storage and computation, which has restricted the deployment of deep neural networks on resource-limited edge devices. To address this …
We present a new method of blackbox optimization via gradient approximation with the use of structured random orthogonal matrices, providing more accurate estimators than baselines and with provable theoretical guarantees. We show that this algorithm can be successfully applied to learn better quality compact policies …