We present a method to generate renewable scenarios using Bayesian probabilities by implementing the Bayesian generative adversarial network~(Bayesian GAN), which is a variant of generative adversarial networks based on two interconnected deep neural networks. By using a Bayesian formulation, generators can be construc…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “networked scenarios”
New algorithm for federated learning without a central server.
problem Federated learning in unidirectional trust social networks.
method Central Server Free Federated Learning (OPS) method.
result Users can benefit from communication with trusted users in federated learning.
Versatile Auxiliary Classifier with Generative Adversarial Network (VAC+GAN), Multi Class Scenarioscs.LG
Conditional generators learn the data distribution for each class in a multi-class scenario and generate samples for a specific class given the right input from the latent space. In this work, a method known as "Versatile Auxiliary Classifier with Generative Adversarial Network" for multi-class scenarios is presented. …
Generative Networks outperform traditional methods in PiT ESG generation.
problem Generating economic scenarios quickly and flexibly for sudden changes.
method Comparison of nonparametric, parametric, and generative models.
result Conditional Variational Autoencoder (CVAE) performs best.
Generative neural networks improve insurance market risk modeling.
problem Creating realistic market risk scenarios for insurance companies.
method Using generative adversarial networks (GANs) to generate economic scenarios.
result GAN-based models produce similar results to traditional regulatory models.
Paper tackles complex risk in deep neural networks.
problem Complex risk in deep neural networks.
method Developed new approach for complex risk statistics.
result Derived dual representation for complex risk.
Generative Adversarial Network (GAN) simulates realistic multi-asset scenarios for tail risk.
problem Simulating realistic joint dynamics of multi-asset portfolios for tail risk estimation.
method Designing a GAN that preserves Value-at-Risk (VaR) and Expected Shortfall (ES) tail risk features.
result Correctly captures tail risk for a broad class of trading strategies and demonstrates strong generalization.
Paper presents a neural network for estimating wavefronts in direction of arrival scenarios.
problem Estimating the number of wavefronts in direction of arrival scenarios.
method Cross-entropy trained multilayer neural network for online adaptation of antenna array imperfections.
result The method outperforms classical model order selection schemes in accuracy, especially at low signal-to-noise-ratios.
Centroids Matching tackles catastrophic forgetting by matching feature vectors to class centroids.
problem Catastrophic forgetting in neural networks when learning new tasks.
method Centroids Matching operates in the embedding space of neural network features, matching these vectors to class centroids.
result Centroids Matching achieves high accuracy on all tasks without using external memory, even in realistic scenarios.
Method generates plausible financial stress scenarios using large deviations.
problem Misleading risk management by overlooking or overemphasizing implausible scenarios.
method Exploits large-deviations principle to concentrate risk factors near most likely stress configurations.
result Can generate informative stress scenarios even with limited historical data.
A new method using energy distance for ensemble and scenario reduction.
problem Solving complex dynamic and stochastic programs, especially in energy systems.
method Proposes a new method based on energy distance for ensemble and scenario reduction.
result Reduced scenario sets exhibit better statistical properties for energy distance than Wasserstein distance.
Generates multimodal safety-critical scenarios for robustness evaluation of decision-making algorithms.
problem Lack of comprehensive evaluation of neural network robustness under real-world scenarios.
method Proposes a flow-based multimodal scenario generator using weighted likelihood maximization and gradient-based sampling.
result Demonstrates improved testing efficiency and multimodal modeling capability compared to traditional methods.
UAVs learn to collect data from IoT sensors efficiently.
problem Efficient UAV path planning for wireless data collection.
method Deep reinforcement learning (DDQN) with experience replay and convolutional layers.
result UAV control policy generalizes over changing scenario parameters.
Standard artificial neural networks suffer from the well-known issue of catastrophic forgetting, making continual or lifelong learning difficult for machine learning. In recent years, numerous methods have been proposed for continual learning, but due to differences in evaluation protocols it is difficult to directly c…
The ability of deep learning models to generalize well across different scenarios depends primarily on the quality and quantity of annotated data. Labeling large amounts of data for all possible scenarios that a model may encounter would not be feasible; if even possible. We propose a framework to deal with limited lab…
New algorithm learns from partial labels in general scenarios.
problem Learning from partial labels when each instance has a bag of labels.
method Adaptive nearest-neighbors algorithm PL A-NN.
result PL A-NN outperforms state-of-the-art methods in general PLL scenarios.
Deep learning methods improve overlapping speaker separation across languages and noise.
problem Overlapping speaker separation in realistic scenarios.
method Deep clustering and deep attractor networks.
result Deep learning methods are effective for a broad range of languages and can handle untrained languages with common features.
LEMs extend transformer-based architectures for complex execution problems.
problem Handling flexible time boundaries and multiple execution constraints in deep learning.
method Decouples market information processing from execution allocation decisions using TKANs, VSNs, and multi-head attention mechanisms.
result LEMs achieve superior execution performance compared to traditional benchmarks.
Study shows benefits of transfer learning with neural networks.
problem Understanding generalization errors in transfer learning.
method Mean-field analysis applied to -ERM and fine-tuning.
result Established conditions for generalization error and convergence rates.
Resource Allocation for a Wireless Coexistence Management System Based on Reinforcement Learningeess.SP
In industrial environments, an increasing amount of wireless devices are used, which utilize license-free bands. As a consequence of these mutual interferences of wireless systems might decrease the state of coexistence. Therefore, a central coexistence management system is needed, which allocates conflict-free resourc…
Much of the focus in the design of deep neural networks has been on improving accuracy, leading to more powerful yet highly complex network architectures that are difficult to deploy in practical scenarios, particularly on edge devices such as mobile and other consumer devices given their high computational and memory …
Paper introduces a new method for improving reinforcement learning performance using transfer learning.
problem Improving reinforcement learning performance with limited sample sizes in dynamic decision-making scenarios.
method Developed a novel ``re-weighted targeting procedure'' and ``transfer deep -learning'' approach.
result Demonstrated improved reinforcement learning performance through strategic sample construction.
Capsule Networks improve autonomous navigation in sparse environments.
problem Challenges in reinforcement learning for sparse reward environments.
method Caps-EM pairs CapsNets with Advantage Actor Critic, using fewer parameters.
result Caps-EM achieves significant time improvements and fewer parameters compared to competing methods.
It has recently been found that Bell scenarios are only a small subclass of interesting setups for studying the non-classical features of quantum theory within spacetime. We find that it is possible to talk about classical correlations, quantum correlations and other kinds of correlations on any directed acyclic graph,…
This paper introduces early exits in neural networks for faster inference.
problem Reducing inference time and preventing overfitting in neural networks.
method Designing and training multi-output neural networks with early exits.
result Significant reductions in inference time and improved robustness.
GANs generate synthetic financial scenarios from diverse datasets.
problem Challenges in modeling correlations between diverse financial factors.
method Generative Adversarial Networks (GANs) for unsupervised data generation.
result GANs can replicate multivariate financial data with high dimensions.
By interpreting a traffic scene as a graph of interacting vehicles, we gain a flexible abstract representation which allows us to apply Graph Neural Network (GNN) models for traffic prediction. These naturally take interaction between traffic participants into account while being computationally efficient and providing…
Generative Adversarial Regression (GAR) learns risk scenarios robustly across policies.
problem Learning risk scenarios for conditional risk objectives.
method Generative adversarial framework for risk matching.
result GAR produces more stable and risk-preserving scenarios than baselines.
Study on adversarial robustness in neural networks across initialization and training phases.
problem Understanding adversarial robustness in neural networks during different learning stages.
method Analyzes adversarial robustness in various scenarios of over-parameterized networks with quadratic targets and infinite samples.
result Robustness can worsen when test error improves, and vice versa, revealing new tradeoffs.
This paper develops an active sensing method to estimate the relative weight (or trust) agents place on their neighbors' information in a social network. The model used for the regression is based on the steady state equation in the linear DeGroot model under the influence of stubborn agents, i.e., agents whose opinion…
Recursive KalmanNet generalizes well in noisy, out-of-distribution scenarios.
problem Generalization in noisy, out-of-distribution scenarios.
method Recurrent neural network guided by a Kalman filter.
result Recursive KalmanNet performs well in scenarios with different temporal dynamics from training data.
Recent changes to greenhouse gas emission policies are catalyzing the electric vehicle (EV) market making it readily accessible to consumers. While there are challenges that arise with dense deployment of EVs, one of the major future concerns is cyber security threat. In this paper, cyber security threats in the form o…
Optimal algorithm for submodular maximization in distributed networked scenarios.
problem Maximizing submodular functions under distributed matroid constraints.
method Constraint-Distributed Continuous Greedy (CDCG) algorithm.
result Achieves a approximation factor, significantly outperforming sequential greedy methods.
Researchers develop PAIN to improve self-driving safety through adversarial training.
problem Overfitting and poor generalizability of neural networks in self-driving vehicles.
method PAIN combines adversarial training in CARLA simulation to generate edge cases.
result Trained self-driving vehicles are more resilient to environmental uncertainty and less prone to collisions.
Two-layer networks learn hard GLMs with SGD in high dimensions.
problem Learning hard generalized linear models with SGD in high-dimensional settings.
method Reduction of SGD dynamics to a stochastic process in lower dimensions, focusing on the role of stochasticity.
result Overparameterization enhances convergence by a constant factor, suggesting minimal role of stochasticity.
Graph Networks are used to make decisions in potentially complex scenarios but it is usually not obvious how or why they made them. In this work, we study the explainability of Graph Network decisions using two main classes of techniques, gradient-based and decomposition-based, on a toy dataset and a chemistry task. Ou…
This paper improves causal inference using deep neural networks for low-dimensional covariates.
problem Improving causal inference with deep learning for high-dimensional covariates.
method Doubly robust off-policy learning with deep neural networks on low-dimensional manifolds.
result Nonasymptotic regret bounds for finite- and continuous-action scenarios, converging at a fast rate depending on intrinsic manifold dimension.
New measure FTC quantifies how much a ReLU network can fine-tune.
problem Analyzing memorization capacity in fine-tuned neural networks.
method Defined Fine-Tuning Capacity (FTC) for additive fine-tuning of ReLU networks.
result Upper and lower bounds on FTC for 2 and 3-layer ReLU networks.
PGMs and GNNs differ in capturing network data; PGMs outperform GNNs in noisy and heterophily scenarios.
problem Comparing PGMs and GNNs in network data.
method Link prediction task with synthetic and real networks; three experiments on input features, noise, and heterophily.
result PGMs outperform GNNs in noisy and heterophily scenarios.
Detection of Accounting Anomalies in the Latent Space using Adversarial Autoencoder Neural Networkscs.LG
The detection of fraud in accounting data is a long-standing challenge in financial statement audits. Nowadays, the majority of applied techniques refer to handcrafted rules derived from known fraud scenarios. While fairly successful, these rules exhibit the drawback that they often fail to generalize beyond known frau…
In recent years, pattern analysis plays an important role in data mining and recognition, and many variants have been proposed to handle complicated scenarios. In the literature, it has been quite familiar with high dimensionality of data samples, but either such characteristics or large data have become usual sense in…
New framework uses MABs for better WLAN performance.
problem Maximizing enterprise WLAN performance with complex AP and station interactions.
method Empowered APs and stations with agents using Thompson sampling to learn optimal channel and AP selection.
result Adaptive framework using MABs outperforms static configurations in various scenarios.
Uncertainty Quantification with Statistical Guarantees in End-to-End Autonomous Driving Controlcs.LG
Deep neural network controllers for autonomous driving have recently benefited from significant performance improvements, and have begun deployment in the real world. Prior to their widespread adoption, safety guarantees are needed on the controller behaviour that properly take account of the uncertainty within the mod…
Introduces neural network for interval-censored survival analysis.
problem Lack of non-linear regression algorithms for interval-censored data.
method Sparse neural network architecture for feature selection and AFT model for prediction.
result Outperforms traditional AFT algorithms in non-linear scenarios.
In this paper we offer a preliminary study of the application of Bayesian coresets to network security data. Network intrusion detection is a field that could take advantage of Bayesian machine learning in modelling uncertainty and managing streaming data; however, the large size of the data sets often hinders the use …
New algorithms improve contextual bandits with neural networks and energy models.
problem Inefficient exploration in non-linear models for contextual bandits.
method Maximum entropy exploration using neural networks and energy models.
result Both techniques outperform standard algorithms, with energy models best overall.
Current generation of memory-augmented neural networks has limited scalability as they cannot efficiently process data that are too large to fit in the external memory storage. One example of this is lifelong learning scenario where the model receives unlimited length of data stream as an input which contains vast majo…
We introduce exact macroscopic on-line learning dynamics of two-layer neural networks with ReLU units in the form of a system of differential equations, using techniques borrowed from statistical physics. For the first experiments, numerical solutions reveal similar behavior compared to sigmoidal activation researched …