Kernel-based algorithm optimizes cellular network configuration through multi-task learning.
problem Optimizing network configuration based on field experience and minimizing exploration cost.
method Kernel-based multi-BS contextual bandit algorithm leveraging conditional kernel embedding for multi-task learning.
result The proposed algorithm reduces exploration cost and improves network performance.
Electric vehicles (EVs) have been gaining popularity due to their environmental friendliness and efficiency. EV charging station networks are scalable solutions for supporting increasing numbers of EVs within modern electric grid constraints, yet few tools exist to aid the physical configuration design of new networks.…
Optimizes glmnet configuration for better accuracy and efficiency.
problem Inappropriate glmnet configuration leads to inaccurate solutions and increased computation time.
method Data-driven framework using neural networks to predict accuracy and computation time from dataset characteristics and configuration.
result Automatic selection of optimal configuration maximizing accuracy under a time constraint.
SORSCNs improve nonstationary data modeling by self-organizing and adjusting network parameters.
problem Nonstationary data challenges traditional models in continuous learning.
method SORSCNs autonomously adjust network parameters and structure in real-time using adaptive algorithms.
result SORSCNs outperform other models in generalizing to nonstationary data.
Designing the architecture for an artificial neural network is a cumbersome task because of the numerous parameters to configure, including activation functions, layer types, and hyper-parameters. With the large number of parameters for most networks nowadays, it is intractable to find a good configuration for a given …
Researchers analyze a new neural network training method.
problem Training robust configurations in discrete weight neural networks.
method Replicated simulated annealing combining physics and classical simulated annealing.
result Explicit criteria for algorithm convergence and successful sampling.
Self-supervised method detects replay spoofing using acoustic configurations.
problem Challenges in collecting large-scale datasets for replay spoofing detection.
method Self-supervised pretraining of acoustic configurations using existing datasets.
result The method outperforms baseline by 30% on ASVspoof 2019 physical access dataset.
Deep learning enhances Hamiltonian Monte Carlo for sampling gauge field configurations.
problem Sampling from complex gauge field topologies efficiently.
method Stacked neural networks to generalize Hamiltonian Monte Carlo.
result Significantly reduces computational cost for generating gauge field configurations.
Optimizes tensor program execution time using graph neural networks.
problem Finding optimal configurations for tensor programs is infeasible due to large configuration space.
method Trains a graph convolutional network on an abstract syntax tree to predict execution time.
result Graph-based surrogate model outperforms heuristic-based methods.
SpatialSim benchmarks machine learning in recognizing object spatial configurations.
problem Machine learning in recognizing precise geometrical configurations of groups of objects.
method SpatialSim benchmark with tasks of Identification and Comparison, using Graph Neural Networks (MPGNNs).
result MPGNNs outperform baselines in recognizing spatial configurations, highlighting current limits.
DeepRSCN models nonlinear systems using stochastic configurations.
problem Modeling nonlinear dynamic systems efficiently.
method Incrementally constructed deep reservoir computing framework with random parameters and online weight updates.
result DeepRSCN outperforms single-layer networks in efficiency, learning, and generalization.
Neural networks learn molecule and material representations.
problem Learning efficient representations for molecules and materials.
method Continuous-filter convolutional network SchNet.
result SchNet accurately predicts chemical properties across various datasets.
New algorithms improve binary neural network configurations.
problem Training binary neural networks efficiently.
method Stochastic message passing algorithms (BP and SP) for discrete inference.
result Stochastic BP and SP find better BNN configurations.
This paper investigates how network width and depth affect adversarially robust DNNs.
problem Understanding architectural configurations for adversarially robust DNNs.
method Comprehensive investigation on the impact of network width and depth on adversarial robustness.
result Optimal architectural configuration for adversarial robustness exists and can improve robustness.
Graph neural networks fail to distinguish certain 3D atom configurations.
problem Graph neural networks (GNN) fail to distinguish certain 3D atom configurations.
method Construction of degenerate 3D atom configurations that are indistinguishable by first-order GNNs.
result First-order GNNs are incomplete for 3D atom configurations.
POCA optimizes hyperparameters with adaptive allocation for faster convergence.
problem Optimizing hyperparameters for machine learning models.
method Adaptive allocation of computational budget using Bayesian sampling.
result POCA finds strong configurations faster than its competitors.
Constructs classifiers for neural networks with specific data configurations.
problem Finding global minima of deep ReLU neural networks on sequentially separable data.
method Explicitly constructs zero loss neural network classifiers using cumulative parameters and truncation maps.
result Global minimizers can be described with a limited number of parameters based on the data structure.
Enhances RSCNs with hybrid regularization for nonlinear dynamics.
problem Modeling nonlinear dynamic systems with uncertainties.
method Recurrent stochastic configuration networks with hybrid regularization.
result The method outperforms other models in nonlinear system identification and industrial tasks.
Modern deep learning methods are very sensitive to many hyperparameters, and, due to the long training times of state-of-the-art models, vanilla Bayesian hyperparameter optimization is typically computationally infeasible. On the other hand, bandit-based configuration evaluation approaches based on random search lack g…
New method generates equilibrium glass configurations efficiently.
problem Sampling equilibrium configurations of amorphous materials is slow and difficult.
method Riemannian stochastic interpolation framework combining Riemannian stochastic interpolant and equivariant flow matching.
result Enforcing geometric and symmetry constraints significantly improves generative performance.
New approach classifies EEG signals for SAD detection with improved accuracy.
problem Detecting SAD using EEG for classification with limited study.
method Exploits EEG sensor spatial configuration with different interpolation methods.
result Model 2 significantly outperforms model 1, providing 6--7% higher accuracy. Stochastic configuration networks (SCNs) as a class of randomized learner model have been successfully employed in data analytics due to its universal approximation capability and fast modelling property. The technical essence lies in stochastically configuring hidden nodes (or basis functions) based on a supervisory m…
Low precision weights, activations, and gradients have been proposed as a way to improve the computational efficiency and memory footprint of deep neural networks. Recently, low precision networks have even shown to be more robust to adversarial attacks. However, typical implementations of low precision DNNs use unifor…
3D neural network models atomistic potentials in complex alloys.
problem Designing robust atomistic potentials for complex alloys is computationally expensive and time-consuming.
method Voxelized atomic configurations and 3D convolutional neural networks to learn atomic interactions.
result 3D convolutional neural networks effectively model atomistic potentials in complex alloys.
A novel Neural Network architecture is proposed using the mathematically and physically rich idea of vector fields as hidden layers to perform nonlinear transformations in the data. The data points are interpreted as particles moving along a flow defined by the vector field which intuitively represents the desired move…
Proposes methods to find alternative blockmodels in networks.
problem Discover secondary blockmodel representations of networks that are dissimilar to a given blockmodel.
method Incorporates non-negative matrix factorisation (NMF) with inclusion of cannot-link constraints and dissimilarity between image matrices.
result Validated the effectiveness of the proposed methods in discovering alternative blockmodels.
Develops HDNNs for mixed geoscience data inputs.
problem Lack of multisource, multi-scale information in deep learning studies.
method Hybrid architecture combining feature and target learning.
result HDNNs achieve higher accuracy and better generalization in reservoir prediction.
Neural networks have been widely used as predictive models to fit data distribution, and they could be implemented through learning a collection of samples. In many applications, however, the given dataset may contain noisy samples or outliers which may result in a poor learner model in terms of generalization. This pa…
Recurrent neural networks are a powerful tool, but they are very sensitive to their hyper-parameter configuration. Moreover, training properly a recurrent neural network is a tough task, therefore selecting an appropriate configuration is critical. Varied strategies have been proposed to tackle this issue. However, mos…
We represent an exchange economy in terms of statistical ensembles for complex networks by introducing the concept of market configuration. This is defined as a sequence of nonnegative discrete random variables {wij} describing the flow of a given commodity from agent i to agent j. This sequence can be arran…
Adapting robust statistics to neural networks, researchers found neural networks can be more robust with certain loss functions.
problem The robustness of neural networks in complex learning tasks.
method Adapting the regression breakdown point from robust statistics to neural networks and comparing different configurations and contamination settings.
result Neural networks can benefit from robust loss functions, as demonstrated in extensive simulations.
CNN detects phase transitions in Potts models without prior knowledge.
problem Detecting phase transitions in q-state Potts models using deep learning. method Trained a deep CNN on Ising model spin configurations and temperatures, then tested on Potts model images.
result Deep CNN accurately detects phase transitions in Potts models, including high- and low-temperature regions.
We consider planar networks of three curves that meet at two junctions with prescribed equal angles, minimizing a combination of the elastic energy and the length functional. We prove existence and regularity of minimizers, and we show some properties of the minimal configurations.
A new framework for causal inference in networked settings.
problem Causal inference under network interference.
method Characterize agent network configuration and use it to estimate treatment effects.
result Finite-sample bounds and asymptotically valid tests for policy irrelevance.
Researchers find optimal configurations of complex knots and links.
problem Finding the most efficient configurations of complex knots and links.
method Minimizing Möbius and Minimum Distance energies by describing them with a small number of free parameters.
result Optimal geometries for Hopf links, Borromean rings, and chain links are found.
A fundamental problem in studying and modeling economic and financial systems is represented by privacy issues, which put severe limitations on the amount of accessible information. Here we introduce a novel, highly nontrivial method to reconstruct the structural properties of complex weighted networks of this kind usi…
Theoretical study explains grokking in neural networks.
problem Understanding the abrupt transition from fitting to generalizing in neural networks.
method Characterized a shell-core topological configuration of the solution space induced by Adam's optimization dynamics.
result Derived grokking scaling laws for learning rate, batch size, and regularization coefficient.
Under-parameterized networks can either copy or average teacher weights, leading to universal optimal solutions.
problem Approximating a teacher network with an under-parameterized student network.
method Analyzing shallow neural networks with erf activation function and unitary teacher weights, proving copy-average configurations are critical points and finding the optimal solution.
result The optimal solution for under-parameterized networks has a universal structure, whether copying or averaging teacher neurons.
As deep neural networks grow in size, from thousands to millions to billions of weights, the performance of those networks becomes limited by our ability to accurately train them. A common naive question arises: if we have a system with billions of degrees of freedom, don't we also need billions of samples to train it?…
Bayesian method predicts future network configurations from past snapshots.
problem Reconstructing evolving networks from partial observations.
method Bayesian approach using past network snapshots to inform future predictions.
result Method accurately predicts link probabilities and network structure.
Computes fundamental groups of restricted configuration spaces.
problem Understanding the structure of configuration spaces after removing hypersurfaces.
method Fibration over unordered configuration spaces of n−1 points, computation of fundamental groups. result Fundamental groups of restricted configuration spaces computed in small dimensions.
Bayesian neural network predicts planetary instability.
problem Predicting planetary instability in compact systems.
method Novel Bayesian neural network trained on raw orbital elements.
result Model predicts planetary instability times with high accuracy and robust generalization.
In artificial neural networks, learning from data is a computationally demanding task in which a large number of connection weights are iteratively tuned through stochastic-gradient-based heuristic processes over a cost-function. It is not well understood how learning occurs in these systems, in particular how they avo…
InverSynth automatically tunes synthesizer parameters from audio input.
problem Manual tuning of synthesizer parameters is time-consuming and requires expertise.
method Strided convolutional neural networks for inferring synthesizer parameters.
result InverSynth outperforms baselines in synthesizer parameter tuning.
Hyperbolic GANs improve image generation metrics.
problem Improving image generation quality in neural networks.
method Integrating hyperbolic layers into GAN architectures.
result Hyperbolic GANs achieve better metrics than Euclidean counterparts.
We study the configuration space of equilateral and equiangular spatial hexagons for any bond angle by giving explicit expressions of all the possible shapes. We show that the chair configuration is isolated, whereas the boat configuration allows one-dimensional deformations which form a circle in the configuration spa…
Prune and Replace NAS expands search space for faster network discovery.
problem Limited search space in recent NAS algorithms.
method Progressively prunes and replaces candidates to explore a larger search space.
result Achieves state-of-the-art error rates on CIFAR datasets.
The concept of SCN offers a fast framework with universal approximation guarantee for lifelong learning of non-stationary data streams. Its adaptive scope selection property enables for proper random generation of hidden unit parameters advancing conventional randomized approaches constrained with a fixed scope of rand…