Research
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,657 papers · 148 categories

Trend · papers per month

3386761,0141,352 · Jun 202019922001200920172026
48 results for adaptive network complexity

Study reveals adversarially robust domain adaptation is harder to generalize across domains.

problem Hardness of transferring adversarial robustness across different domains.
method Analysis of adversarial Rademacher complexity over symmetric difference hypothesis space.
result Adversarial Rademacher complexity is always greater than non-adversarial, indicating intrinsic hardness.

Sparse Meta Networks adapt deep neural networks incrementally for fast learning.

problem Training deep neural networks is slow and impractical for complex, changing environments.
method Sparse Meta Networks use a memory layer to learn online sequential adaptation, accumulating fast-weights incrementally.
result Sparse Meta Networks achieve strong performance in various sequential adaptation scenarios.

PALMS reconstructs large-scale networks efficiently with parallel computing.

problem Reconstructing large-scale latent networks from observed dynamics is computationally challenging.
method PALMS (Parallel Adaptive Lasso with Multi-directional Signals) framework for distributed network reconstruction.
result PALMS substantially reduces computational complexity and storage requirements.

FVI method calculates bicausal OT with neural networks, outperforming other methods.

problem Computing bicausal optimal transport with adapted coupling structures.
method FVI method using multilayer neural networks to approximate value functions.
result FVI method outperforms linear programming and Sinkhorn methods in scalability.

Enhances physics-informed neural networks with adaptive sampling and weighting.

problem Challenges in training physics-informed neural networks on complex problems.
method Hybrid adaptive sampling and weighting method.
result Consistently improves prediction accuracy and training efficiency.

We present an approach to adaptively utilize deep neural networks in order to reduce the evaluation time on new examples without loss of accuracy. Rather than attempting to redesign or approximate existing networks, we propose two schemes that adaptively utilize networks. We first pose an adaptive network evaluation sc…

2017-02-25abs ↗pdf ↗

AGCRN forecasts traffic using adaptive graph and recurrent learning.

problem Forecasting traffic dynamics with complex spatial and temporal correlations.
method Adaptive Graph Convolutional Recurrent Network (AGCRN) with Node Adaptive Parameter Learning (NAPL) and Data Adaptive Graph Generation (DAGG).
result AGCRN outperforms state-of-the-art models without pre-defined graphs.

Adaptive weights improve physics-informed neural networks and deep operator networks.

problem Training physics-informed neural networks and deep operator networks can be challenging, leading to unsatisfactory accuracy and efficiency.
method Proposes a pointwise adaptive weighting method that balances the residual decay rate across different training points.
result Our proposed approach of balanced residual decay rates offers advantages including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent…

2007-01-13abs ↗pdf ↗

This research explores complex-valued neural networks and their implementation.

problem The challenges of implementing complex-valued neural networks and their potential for non-complex data.
method Detailed theory and implementation of CVNN, including Wirtinger calculus, complex backpropagation, and modules like complex layers and activation functions. Python implementation using cvnn toolbox.
result Demonstrates the potential of CVNN for non-complex data through simulations.

Great successes of deep neural networks have been witnessed in various real applications. Many algorithmic and implementation techniques have been developed, however, theoretical understanding of many aspects of deep neural networks is far from clear. A particular interesting issue is the usefulness of dropout, which w…

2014-02-16abs ↗pdf ↗

New algorithm improves Bayesian neural networks using adaptive importance sampling.

problem High computational cost in training Bayesian neural networks.
method Adaptive Importance Sampling (AIS) integrated into a novel algorithm (PMCnet).
result Improved performance and exploration capabilities for both shallow and deep neural networks.

With the recent advances in complex networks theory, graph-based techniques for image segmentation has attracted great attention recently. In order to segment the image into meaningful connected components, this paper proposes an image segmentation general framework using complex networks based community detection algo…

2019-07-04abs ↗pdf ↗

Unified analysis of generalization and sample complexity for semi-supervised domain adaptation.

problem Theoretical foundations of domain adaptation remain underexplored, especially for modern approaches.
method Unified theoretical study of domain adaptation algorithms based on domain alignment, considering joint learning of feature transformations and shared classifiers in a semi-supervised setting.
result Unified theoretical analysis of domain adaptation algorithms, providing generalization bounds and sample complexity bounds for MMD and adversarial models.

Networks are a natural representation of complex systems across the sciences, and higher-order dependencies are central to the understanding and modeling of these systems. However, in many practical applications such as online social networks, networks are massive, dynamic, and naturally streaming, where pairwise inter…

2019-08-02abs ↗pdf ↗

Domain Adaptation in 6G wireless networks: When is it green?

problem Energy consumption of Domain Adaptation (UDA) compared to single-task training in 6G wireless networks.
method Investigate energy consumption and propose a method to determine the minimum number of target domains for UDA to be more energy-efficient than retraining.
result Proposed a method to determine the minimum number of target domains for UDA to be more energy-efficient than retraining.

Spectral graph convolutional neural networks (CNNs) require approximation to the convolution to alleviate the computational complexity, resulting in performance loss. This paper proposes the topology adaptive graph convolutional network (TAGCN), a novel graph convolutional network defined in the vertex domain. We provi…

2017-10-28abs ↗pdf ↗

PrAda-GAN improves synthetic data generation under differential privacy.

problem Generating synthetic data under differential privacy with marginal-based methods.
method Sequential generator architecture integrating GAN and marginal-based approaches, with adaptive regularization of Bayes network structure.
result PrAda-GAN outperforms existing methods in privacy-utility trade-off on synthetic and real-world datasets.

Multi-agent models have been used in many contexts to study generic collective behavior. Similarly, complex networks have become very popular because of the diversity of growth rules giving rise to scale-free behavior. Here we study adaptive networks where the agents trade ``wealth'' when they are linked together while…

2008-04-25abs ↗pdf ↗

Training deep neural networks requires intricate initialization and careful selection of learning rates. The emergence of stochastic gradient optimization methods that use adaptive learning rates based on squared past gradients, e.g., AdaGrad, AdaDelta, and Adam, eases the job slightly. However, such methods have also …

2019-10-27abs ↗pdf ↗

Over the last decade, both the neural network and kernel adaptive filter have successfully been used for nonlinear signal processing. However, they suffer from high computational cost caused by their complex/growing network structures. In this paper, we propose two random Euler filters for complex-valued nonlinear filt…

2018-01-02abs ↗pdf ↗

Complex networks are ubiquitous to several Computer Science domains. Centrality measures are an important analysis mechanism to uncover vital elements of complex networks. However, these metrics have high computational costs and requirements that hinder their applications in large real-world networks. In this tutorial,…

2018-10-28abs ↗pdf ↗

Although the recent progress in the deep neural network has led to the development of learnable local feature descriptors, there is no explicit answer for estimation of the necessary size of a neural network. Specifically, the local feature is represented in a low dimensional space, so the neural network should have mo…

2017-06-16abs ↗pdf ↗

TIME network simplifies complex physical processes with interpretable models.

problem Challenges in learning coupled dynamic processes from multiple observations.
method Fully convolutional architecture capturing invariant domain structure.
result Robust and transparent in capturing process kernels and anomalies.

Paper introduces new neural network models and theories.

problem Understanding neural networks beyond over-parameterized regime.
method Develops two exact models and a novel representor theory.
result Provides insights into neural network training and kernel evolution.

This research introduces an autonomous robot navigation method using reinforcement learning.

problem Improving robot navigation in complex environments.
method Deep Q Network (DQN) and Proximal Policy Optimization (PPO) models for path planning and decision-making.
result The models enhance robot navigation ability and adaptive learning in unknown environments.

New bounds improve generalization for deep neural networks in domain adaptation.

problem Deriving tight generalization guarantees for deep neural networks in domain adaptation.
method Combining data-dependent PAC-Bayes analysis with importance weighting.
result A simple importance weighting extension provides the tightest estimable bound.

We show how different approaches to developing marketing strategies depending on the type of environment a firm faces, where environments are distinguished in terms of their systems properties not their context. Particular emphasis is given to turbulent environments in which outcomes are not a priori predictable and ar…

2012-03-06abs ↗pdf ↗

This paper considers the problem of adaptively searching for an unknown target using multiple agents connected through a time-varying network topology. Agents are equipped with sensors capable of fast information processing, and we propose a decentralized collaborative algorithm for controlling their search given noisy…

2015-11-10abs ↗pdf ↗

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.

FNSDA adapts to new dynamics via Fourier space adaptation.

problem Generalizing to unseen dynamical systems with limited data.
method Automatic partitioning of known environments in Fourier modes and adaptation of specific modes for new environments.
result FNSDA achieves superior or competitive generalization performance with reduced parameter cost.

Adaptive networks improve model robustness through conditional normalization.

problem Limited robustness of adversarial-trained networks due to network capacity and training samples.
method Proposes a conditional normalization module to adapt networks during adversarial training.
result Adaptive networks outperform both clean validation accuracy and robustness compared to non-adaptive counterparts.