In this paper, we explore the effectiveness of dynamic analysis techniques for identifying malware, using Hidden Markov Models (HMMs) and Profile Hidden Markov Models (PHMMs), both trained on sequences of API calls. We contrast our results to static analysis using HMMs trained on sequences of opcodes, and show that dyn…
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
48 results for “dynamical techniques”
Study risk-controlling prediction sets for single trajectory data from dynamical systems.
problem Performance guarantees for risk-controlling prediction sets in single trajectory data from unknown stochastic dynamical systems.
method Used blocking and decoupling techniques to analyze performance guarantees under different data generating processes.
result Performance guarantees similar to iid setting when data is stationary and contractive, with graceful degradation otherwise.
Enhances load forecasting for multiple entities with dynamic similarities.
problem Inaccurate probabilistic load predictions due to uncertainties and dynamic changes.
method Online multi-task learning for probabilistic load forecasting.
result Significantly enhances load forecasting accuracy across various scenarios.
This paper presents a mesoscopic traffic flow model that explicitly describes the spatio-temporal evolution of the probability distributions of vehicle trajectories. The dynamics are represented by a sequence of factor graphs, which enable learning of traffic dynamics from limited Lagrangian measurements using an effic…
Experimental measurements of physical systems often have a limited number of independent channels, causing essential dynamical variables to remain unobserved. However, many popular methods for unsupervised inference of latent dynamics from experimental data implicitly assume that the measurements have higher intrinsic …
Algorithm learns dynamics from past observations.
problem Learning a nonlinear dynamical system.
method Spectral filtering, online convex optimization.
result Vanishing prediction error for marginally stable systems.
Study optimizes investment strategies in volatile markets using machine learning and Bayesian techniques.
problem Enhancing portfolio management in volatile markets.
method Market segmentation into ten volatility-based states, real-time asset allocation adjustments using Bayesian Markov switching model.
result Dynamic portfolio achieves significantly higher risk-adjusted returns and total returns.
Analyzing different prototype selection techniques for dynamic classifier and ensemble selectioncs.LG
In dynamic selection (DS) techniques, only the most competent classifiers, for the classification of a specific test sample are selected to predict the sample's class labels. The more important step in DES techniques is estimating the competence of the base classifiers for the classification of each specific test sampl…
The symbolic dynamics technique is well-known for low-dimensional dynamical systems and chaotic maps, and lies at the roots of the thermodynamic formalism of dynamical systems. Here we show that this technique can also be successfully applied to time series generated by complex systems of much higher dimensionality. Ou…
Paper analyzes dynamics of nonholonomic systems with collisions using variational techniques.
problem Analyzing the dynamics of nonholonomic mechanical systems with impacts.
method Variational techniques extended to nonsmooth context for collisions.
result Variational formulation for implicit nonholonomic mechanical systems with energy-momentum preserving collisions.
We present a novel technique for learning the mass matrices in samplers obtained from discretized dynamics that preserve some energy function. Existing adaptive samplers use Riemannian preconditioning techniques, where the mass matrices are functions of the parameters being sampled. This leads to significant complexiti…
Established techniques for simulation and prediction with Gaussian process (GP) dynamics often implicitly make use of an independence assumption on successive function evaluations of the dynamics model. This can result in significant error and underestimation of the prediction uncertainty, potentially leading to failur…
Many real-valued stochastic time-series are locally linear (Gassian), but globally non-linear. For example, the trajectory of a human hand gesture can be viewed as a linear dynamic system driven by a nonlinear dynamic system that represents muscle actions. We present a mixed-state dynamic graphical model in which a hid…
Proposes dynamic model type recommendation for OLP technique.
problem Limited local competence of base-classifiers in uneven data distributions.
method Builds a multi-label meta-classifier to recommend model types based on local data complexity.
result Statistically similar performance to original OLP with fixed base-classifier model.
An exploration of the mathematical structure and behavioural biases of 21st century financial crisesq-fin.ST
Study financial crises using mathematical techniques to compare equity performance.
problem Comparing financial crises to understand market dynamics and investor strategies.
method New mathematical techniques including portfolio diversification, linear operator method, and combinatorial portfolio optimisation.
result New methods to quantify and compare equity returns during different market crises.
Scalable Autonomous Vehicle Safety Validation through Dynamic Programming and Scene Decompositioncs.RO
New approach uses dynamic programming to efficiently discover failures in autonomous vehicle simulations.
problem Efficiently discovering rare failure events in autonomous vehicle simulations.
method Approximate dynamic programming and scene decomposition to estimate failure distribution.
result Increased number of failures discovered compared to baseline approaches.
Inspired by the success of deep learning techniques in the physical and chemical sciences, we apply a modification of an autoencoder type deep neural network to the task of dimension reduction of molecular dynamics data. We can show that our time-lagged autoencoder reliably finds low-dimensional embeddings for high-dim…
Develops an oblique projection technique to approximate a foliation for non-normal dynamics.
problem Modeling dynamics far from a primary Spectral Submanifold (SSM) in non-normal systems.
method Oblique projection technique based on experimental data.
result Approximates a stable invariant foliation for non-normal dynamics efficiently.
To improve the execution speed and efficiency of neural networks in embedded systems, it is crucial to decrease the model size and computational complexity. In addition to conventional compression techniques, e.g., weight pruning and quantization, removing unimportant activations can reduce the amount of data communica…
Extends DeTEcT framework for token economies with dynamic and probabilistic parameters.
problem Modeling wealth distribution in token economies with dynamic and probabilistic parameters.
method Introduces four parametrization techniques: dynamic vs static, probabilistic vs non-probabilistic.
result Derives existing wealth distribution models from DeTEcT framework with added restrictions.
Multiple classifier systems focus on the combination of classifiers to obtain better performance than a single robust one. These systems unfold three major phases: pool generation, selection and integration. One of the most promising MCS approaches is Dynamic Selection (DS), which relies on finding the most competent c…
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.
Modern deep neural networks are typically highly overparameterized. Pruning techniques are able to remove a significant fraction of network parameters with little loss in accuracy. Recently, techniques based on dynamic reallocation of non-zero parameters have emerged, allowing direct training of sparse networks without…
Lifelong learning is a very important step toward realizing robust autonomous artificial agents. Neural networks are the main engine of deep learning, which is the current state-of-the-art technique in formulating adaptive artificial intelligent systems. However, neural networks suffer from catastrophic forgetting when…
New bounds for SGD generalize without mutual information terms.
problem Generalizing SGD's learning dynamics for heavy-tailed distributions.
method Introducing a geometric decoupling term and bounding it computably.
result Proved generalization bounds without mutual information terms.
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 …
New method integrates sparse parametric and nonparametric techniques for complex system modeling.
problem Lack of accurate modeling for complex biological systems due to nonlinearities.
method Sparse nonparametric estimation framework combining parametric and nonparametric techniques.
result Accurately captures nonlinearities in complex systems without prior information.
The paper develops techniques to study dynamical systems with Carnot metrics.
problem Understanding smooth dynamical systems in the presence of Carnot metrics.
method Employing techniques from Margulis-Mostow, Métivier, Mitchell, and Pansu on tangent cones, the paper establishes resonances between Lyapunov exponents.
result Local rigidity properties of higher hyperbolic rank metrics and uniform lattice actions on quaternionic and octonionic symmetric spaces.
Novel data acquisition schemes have been an emerging need for scanning microscopy based imaging techniques to reduce the time in data acquisition and to minimize probing radiation in sample exposure. Varies sparse sampling schemes have been studied and are ideally suited for such applications where the images can be re…
Paper interprets contrastive learning dynamics using message passing.
problem Lack of rigorous understanding of contrastive learning dynamics.
method Casts contrastive objective into message passing scheme on augmentation graph.
result The learning dynamics of contrastive learning can be theoretically characterized.
This paper presents a novel approach for incremental semiparametric inverse dynamics learning. In particular, we consider the mixture of two approaches: Parametric modeling based on rigid body dynamics equations and nonparametric modeling based on incremental kernel methods, with no prior information on the mechanical …
Paper develops a neural-fuzzy controller for GPS-intelligent buoys.
problem Optimally track dynamically positioned marine buoys with unknown parameters.
method Dynamic system modeling using neural-fuzzy networks with backstepping technique.
result The controller minimizes position errors and adjusts buoy positions accurately.
Novel approach to Bayesian experimental design for non-exchangeable data.
problem Optimal experimental design for non-exchangeable data.
method Inside-Out SMC algorithm embedded in particle Markov chain Monte Carlo framework.
result Efficacy demonstrated on a set of dynamical systems.
New techniques improve the accuracy of identifying nonlinear systems from noisy data.
problem Identifying nonlinear dynamical systems from noisy state measurements.
method Comparative study of local and global smoothing techniques to denoise state measurements and improve sparse regression methods.
result Global smoothing methods outperform local methods in improving the accuracy of governing equation recovery.
Proves Arnold conjecture for singular symplectic manifolds using novel techniques.
problem Hamiltonian dynamics on singular symplectic manifolds.
method Introducing smooth symplectic forms to singular symplectic structures under mild conditions, using Floer homology.
result Proves a lower bound on the number of 1-periodic Hamiltonian orbits for -symplectic manifolds.
We use techniques from network science to study correlations in the foreign exchange (FX) market over the period 1991--2008. We consider an FX market network in which each node represents an exchange rate and each weighted edge represents a time-dependent correlation between the rates. To provide insights into the clus…
Dynamic classifier chains with XGBoost reduces multi-label classification costs and improves label dependency handling.
problem Static label ordering in multi-label classification limits model performance.
method Combining dynamic classifier chains with XGBoost for efficient multi-label prediction.
result Dynamic label ordering improves model performance and reduces training costs.
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched t…
Quantum model generates complex time series data with preserved temporal dynamics.
problem Generating synthetic time series data with temporal correlations.
method Quantum Hamiltonian learning to encode temporal dynamics.
result The proposed quantum model captures unique temporal features of the learned time series.
New methods improve multi-agent reinforcement learning by addressing rotational dynamics.
problem Reproducibility crisis in multi-agent reinforcement learning.
method Reframing MARL approaches using Variational Inequalities (VIs) and proposing gradient-based VI methods.
result Significant performance improvements across benchmarks, including better convergence to equilibrium strategies in zero-sum games.
New dynamic backdoor attacks bypass current defenses.
problem Vulnerability of machine learning models to backdoor attacks.
method Random Backdoor, Backdoor Generating Network (BaN), and conditional Backdoor Generating Network (c-BaN).
result Dynamic backdoors can bypass current detection and defense mechanisms.
This paper presents a novel deep reinforcement learning-based resource allocation technique for the multi-agent environment presented by a cognitive radio network that coexists through underlay dynamic spectrum access (DSA) with a primary network. The resource allocation technique presented in this work is distributed,…
Solves portfolio optimization with costs using numerical methods.
problem Dynamic portfolio optimization with transaction costs and constraints.
method Numerical dynamic programming techniques.
result Problems can now be solved tractably.
Attack graphs provide compact representations of the attack paths that an attacker can follow to compromise network resources by analysing network vulnerabilities and topology. These representations are a powerful tool for security risk assessment. Bayesian inference on attack graphs enables the estimation of the risk …
This paper uses neural networks to predict stock prices more accurately.
problem Current stock analysis methods are inaccurate.
method Dynamic neural networks to identify stock price patterns.
result Neural networks outperform traditional stock analysis methods.
On the Integration of Physics-Based Machine Learning with Hierarchical Bayesian Modeling Techniquesstat.ML
Combines physics-based ML with hierarchical Bayesian techniques for better model performance.
problem Lack of physical knowledge in black-box machine learning models.
method Embeds physics-based models into Gaussian Process mean function and uses kernel machines to characterize discrepancies.
result Improved model performance under blind conditions through integration of physics-based knowledge.
Combines Kleinian groups and polynomials into a dynamical system.
problem Connecting Kleinian groups and rational dynamics.
method Framework for combining Fuchsian groups with complex polynomials.
result Establishes a new dynamical system on the Riemann sphere.
Algebraic correspondences and Schwarz reflections: Where rational dynamics meets Kleinian groupsmath.DS
Overview of dynamics in algebraic correspondences and their connections.
problem Understanding dynamics in algebraic correspondences and their connections.
method Focus on matings between rational maps and Kleinian groups, highlighting unifying structures.
result Rich dynamics and connections between moduli spaces of rational maps and Kleinian groups.