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

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for Dynamic Resizing

Proposes continuous convolution layers for flexible feature map resizing.

problem Fixed stride limitations in discrete convolution layers.
method Introduces Continuous Convolution (CC) layers that use learned continuous functions.
result Dynamic and consistent resizing of feature maps at any scale, non-integer and axis-dependent.

Determining the appropriate batch size for mini-batch gradient descent is always time consuming as it often relies on grid search. This paper considers a resizable mini-batch gradient descent (RMGD) algorithm based on a multi-armed bandit for achieving best performance in grid search by selecting an appropriate batch s…

2017-11-17abs ↗pdf ↗

We propose a novel method to train deep convolutional neural networks which learn from multiple data sets of varying input sizes through weight sharing. This is an advantage in chemometrics where individual measurements represent exact chemical compounds and thus signals cannot be translated or resized without disturbi…

2019-10-01abs ↗pdf ↗

Bayesian optimization has recently emerged as a popular and efficient tool for global optimization and hyperparameter tuning. Currently, the established Bayesian optimization practice requires a user-defined bounding box which is assumed to contain the optimizer. However, when little is known about the probed objective…

2015-08-14abs ↗pdf ↗

More and more companies have deployed machine learning (ML) clusters, where deep learning (DL) models are trained for providing various AI-driven services. Efficient resource scheduling is essential for maximal utilization of expensive DL clusters. Existing cluster schedulers either are agnostic to ML workload characte…

2019-09-13abs ↗pdf ↗

Most existing GANs architectures that generate images use transposed convolution or resize-convolution as their upsampling algorithm from lower to higher resolution feature maps in the generator. We argue that this kind of fixed operation is problematic for GANs to model objects that have very different visual appearan…

2018-01-25abs ↗pdf ↗

Synthesizing high resolution photorealistic images has been a long-standing challenge in machine learning. In this paper we introduce new methods for the improved training of generative adversarial networks (GANs) for image synthesis. We construct a variant of GANs employing label conditioning that results in 128x128 r…

2016-10-30abs ↗pdf ↗

SVMs improve forest fire detection accuracy on challenging datasets.

problem Rapid and accurate detection of forest fires.
method Training SVMs on labeled fire image datasets, focusing on data preprocessing, feature extraction, and model training.
result SVMs enhance detection accuracy on complex datasets, revealing key parameters affecting performance.

Aggregation defenses improve deep learning models' robustness against data poisoning attacks.

problem Data poisoning attacks manipulate deep learning models with malicious training samples.
method Deep Partition Aggregation, efficiency improvements, data-to-complexity ratio, poisoning overfitting phenomenon.
result Aggregation defenses boost poisoning robustness through the poisoning overfitting phenomenon.

This paper examines how labeling error affects contrastive learning and proposes data dimensionality reduction methods to mitigate its impact.

problem The impact of labeling error on the performance of contrastive learning.
method Data dimensionality reduction methods (e.g., SVD) are applied to reduce false positive samples and improve downstream classification accuracy.
result Data dimensionality reduction methods can mitigate the negative impacts of labeling error on downstream classification performance.

Study on 2-valued dynamics on complex plane, showing some dynamics can't be group actions.

problem Whether 2-valued dynamics can be defined by the action of a 2-valued group.
method Construction of examples of dynamics that are or are not group actions.
result Some 2-valued dynamics on complex plane cannot be defined by the action of a 2-valued group.

The paper studies dynamic star-shaped risk measures and their representation.

problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.

DOODL learns shared spectral dynamics across related dynamical systems.

problem Learning independent dynamical operators for each system limits discovery of shared structure.
method DOODL learns a dictionary of characteristic spectral dynamics on a manifold of related systems.
result DOODL achieves errors one to two orders of magnitude lower than independent operator estimation methods.

We propose a new class of mappings, called Dynamic Limit Growth Indices, that are designed to measure the long-run performance of a financial portfolio in discrete time setup. We study various important properties for this new class of measures, and in particular, we provide necessary and sufficient condition for a Dyn…

2013-12-04abs ↗pdf ↗

Unified analysis of DLNs using DMFT reveals dynamics of loss convergence and generalization trade-offs.

problem Understanding the overall dynamics of diagonal linear networks (DLNs) in neural network training.
method Dynamical Mean-Field Theory (DMFT) applied to DLNs.
result Derives low-dimensional effective process capturing high-dimensional gradient flow dynamics.

dLDS models neural dynamics as sparse combinations of simpler components.

problem Understanding complex neural dynamics at a population level.
method Proposes a decomposed dynamical system model trained through dictionary learning.
result Model efficiently captures and demix diverse neural dynamics.

Reinforcement learning would enjoy better success on real-world problems if domain knowledge could be imparted to the algorithm by the modelers. Most problems have both hidden state and unknown dynamics. Partially observable Markov decision processes (POMDPs) allow for the modeling of both. Unfortunately, they do not p…

2012-12-12abs ↗pdf ↗

We consider trivializations of second iterated bundles of a Lie group that preserve lifted group structures. With such a trivialization, we elaborate Hamiltonian dynamics on cotangent, Lagrangian dynamics on tangent bundles and, both Hamiltonian and Lagrangian dynamics on Tulczyjew's symplectic space which is tangent o…

2015-03-23abs ↗pdf ↗

This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.

problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.

Framework infers Langevin dynamics from stochastic observations of latent systems.

problem Inferring non-stationary Langevin dynamics from indirect stochastic observations.
method Non-parametric framework explicitly modeling stochastic observation process and non-stationary latent dynamics.
result Correct inference of non-stationary dynamics requires accounting for non-equilibrium states and observation duration.

The paper extends Vlasov kinetic theory to time-dependent dynamics using cosymplectic and cocontact manifolds.

problem Extending Vlasov kinetic theory to time-dependent dynamics.
method Introducing geometric kinetic theories within cosymplectic and cocontact manifolds.
result Alternative realizations of cosymplectic and cocontact kinetic theories linked via Poisson/momentum maps.

NDS learns dynamical models with prior knowledge, improving accuracy and efficiency.

problem Learning accurate dynamical models with limited data and varying dynamics.
method Neural Dynamical Systems (NDS) integrates prior knowledge in ODEs with neural networks to estimate parameters and predict states.
result NDS achieves higher accuracy and uses fewer samples compared to other methods.

New method learns population dynamics from snapshots, outperforming existing models.

problem Capturing periodic and other dynamical properties of population dynamics.
method Wasserstein Lagrangian Mechanics (WLM) for learning second-order dynamics from observed marginals.
result WLM outperforms existing methods across various dynamics, including vortex dynamics, embryonic development, and flocking.

Paper uses Chebyshev Tensors for accurate dynamic sensitivities and ISDA SIMM computation.

problem Computing dynamic sensitivities and initial margin for financial instruments.
method Uses Chebyshev Tensors in Monte Carlo simulations to compute dynamic sensitivities and ISDA SIMM.
result High accuracy and computational gains for FX swaps and Spread Options.

Survey on computational models in dynamical systems, including new universality concepts.

problem Understanding the relationship between computational models and dynamical systems.
method Review of recent works on Turing universality, Topological Kleene Field Theories, and dynamical bordisms.
result Introduction of new perspectives on computability through dynamical systems.

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.

Dynamic risk assessment method for WUI fires improves upon static frameworks.

problem Static risk assessment methods fail to capture dynamic changes in WUI fire risks.
method Dynamic evaluation matrix, grey incidence analysis, optimization model.
result The proposed method effectively captures dynamic risk evolution patterns.

Develops a method to model neural dynamics with flexible yet interpretable latent states.

problem Capturing complex nonlinear dynamics in neural time series while maintaining interpretability.
method Gaussian Process Switching Linear Dynamical System (gpSLDS) that balances expressiveness and interpretability.
result Favorable performance in comparison to rSLDS on synthetic and real neuroscience data.