New method detects anomalies in computing centers' logs.
problem Anomaly detection in continuously changing log data for predictive maintenance.
method Evolving granular classifiers using Fuzzy-set-Based evolving Modeling and evolving Granular Neural Network.
result Classification model prioritizes maintenance based on anomaly severity.
Dynamic networks are a general language for describing time-evolving complex systems, and discrete time network models provide an emerging statistical technique for various applications. It is a fundamental research question to detect the community structure in time-evolving networks. However, due to significant comput…
A new neural model evolves to learn at the synaptic level.
problem Lack of biologically realistic neural models in deep learning.
method Evolve individual neuron and synaptic models using ENUs.
result Evolved neural network learns complex tasks like a T-maze.
SYNC learns time-aware causal representations to improve model generalization in evolving domains.
problem Spurious correlations and shortcut learning in existing EDG methods hinder model generalization.
method SYNC integrates dynamic causal factors and causal mechanism drifts into a sequential VAE framework.
result SYNC achieves superior temporal generalization performance on synthetic and real-world datasets.
EvoMSN tackles time series forecasting under distribution shifts by evolving multi-scale normalization.
problem Accurate long-term time series forecasting under complex distribution shifts.
method EvoMSN framework with multi-scale statistics prediction and adaptive ensembling for collaborative updating.
result Improves forecasting performance of five mainstream methods on benchmark datasets.
EML model tackles evolving features in online metric learning.
problem Challenges in applying metric learning to evolving features.
method Develops a new Evolving Metric Learning (EML) model for incremental and decremental features.
result EML model handles instance and feature evolutions simultaneously.
Fuzzy eIX method evolves classifiers for online data streams.
problem Handling time-varying classifiers in online data streams.
method Develops evolving Internal-eXternal Fuzzy granules for numerical data.
result Fuzzy eIX maintains high accuracy in dynamic scenarios.
This paper demonstrates the use of genetic algorithms for evolving: 1) a grandmaster-level evaluation function, and 2) a search mechanism for a chess program, the parameter values of which are initialized randomly. The evaluation function of the program is evolved by learning from databases of (human) grandmaster games…
We present a simple one-parameter model for spatially localised evolving agents competing for spatially localised resources. The model considers selling agents able to evolve their pricing strategy in competition for a fixed market. Despite its simplicity, the model displays extraordinarily rich behavior. In addition t…
Proves upper bounds for heat kernels evolving on manifolds.
problem Bounding heat kernels on evolving manifolds.
method Logarithmic Sobolev inequalities and ultracontractivity estimates.
result Gaussian upper bounds for heat kernels are derived.
EXAMM evolves RNNs for stock return prediction and portfolio trading.
problem Predicting stock returns for optimal portfolio trading.
method Evolutionary Neural Architecture Search (EXAMM) for evolving RNNs.
result Evolving RNNs outperform traditional benchmarks in stock trading.
Establishes Calderón-Zygmund inequalities on evolving Riemannian manifolds.
problem Calderón-Zygmund inequalities on evolving Riemannian manifolds.
method Establishes various Calderón-Zygmund inequalities on evolving Riemannian manifolds with bounded curvature.
result Provides concrete applications of established inequalities.
Simultaneous clustering and optimization (SCO) has recently drawn much attention due to its wide range of practical applications. Many methods have been previously proposed to solve this problem and obtain the optimal model. However, when a dataset evolves over time, those existing methods have to update the model freq…
Proposes tPARAFAC2 for tracking evolving patterns in time-evolving data.
problem Lack of temporal regularization in tensor factorizations for capturing evolving patterns.
method Temporal PARAFAC2 (tPARAFAC2) with temporal regularization.
result tPARAFAC2 accurately captures evolving patterns better than existing methods.
A fast spectral algorithm detects community structure in evolving graphs.
problem Detecting community structure in time-evolving sparse graphs.
method Extension of the Bethe-Hessian matrix for spectral community detection.
result The algorithm reaches the optimal detectability threshold and outperforms other methods.
Many networks are complex dynamical systems, where both attributes of nodes and topology of the network (link structure) can change with time. We propose a model of co-evolving networks where both node at- tributes and network structure evolve under mutual influence. Specifically, we consider a mixed membership stochas…
GRADE models evolving graph dynamics by learning node and community representations.
problem Lack of tools to study temporal community dynamics in evolving graphs.
method GRADE is a probabilistic model that learns evolving node and community representations via a random walk prior and variational inference.
result GRADE outperforms baselines in dynamic link prediction and dynamic community detection.
This paper demonstrates the use of genetic algorithms for evolving a grandmaster-level evaluation function for a chess program. This is achieved by combining supervised and unsupervised learning. In the supervised learning phase the organisms are evolved to mimic the behavior of human grandmasters, and in the unsupervi…
eva method improves RL models by adaptively creating prompts, boosting performance.
problem Fixed prompt distribution limits scalability of RL models post-training.
method Evolving Alignment via Asymmetric Self-Play (eva) approach.
result Significant performance boost on benchmarks, e.g. 51.6% to 60.1% win-rate.
Develops a new GLM framework for claims reserving with adaptive estimation.
problem Accurate assessment of claims reserves with dynamic and dependent claim activity.
method Multivariate evolutionary GLM framework with adaptive particle filtering algorithm.
result Adaptive estimation of evolving factors improves claims reserve accuracy.
We formulate stochastic partial differential equations on Riemannian manifolds, moving surfaces, general evolving Riemannian manifolds (with appropriate assumptions) and Riemannian manifolds with random metrics, in the variational setting of the analysis to stochastic partial differential equations. Considering mainly …
Derives new orthogonal coordinates for evolving surfaces and curves.
problem Accounting for geometric effects in boundary layer asymptotics.
method Elementary derivation of orthogonal signed-distance coordinates.
result Provides vector calculus identities for these coordinates.
A scalable framework uses Langevin sampling to approximate neural network models of evolving processes.
problem Uncertainty quantification in neural network models of dynamic systems.
method Flexible data model based on NODE, joint learning of data model and posterior parameters, Langevin sampling.
result Demonstrated performance on chemical reaction and material physics data, compared favorably to variational inference.
Method learns evolving policies in healthcare contexts.
problem Understanding non-stationary behavior in evolving decision-making processes.
method Inverse Contextual Bandits (ICB) approach for learning interpretable representations of non-stationary behavior.
result Demonstrated applicability and accuracy of ICB method in liver transplantation policies.
Study examines AutoML adaptation to evolving data.
problem Understanding and improving AutoML performance with concept drift.
method 6 concept drift adaptation strategies evaluated on various AutoML approaches.
result Robust AutoML techniques can be developed to handle concept drift.
We show that a simple model of a spatially resolved evolving economic system, which has a steady state under simultaneous updating, shows stable oscillations in price when updated asynchronously. The oscillations arise from a gradual decline of the mean price due to competition among sellers competing for the same reso…
e-GGPs learn graph vertex transitions over time.
problem Static graph Gaussian Processes cannot handle dynamic graph structures.
method Proposes e-GGPs with a transition function and neighbourhood kernel.
result e-GGPs outperform static GGPs on time-series regression.
We investigate the evolution of open curves with fixed endpoints under the curve shortening flow, which evolves curves in proportion to their curvature. Using a distance comparison of Huisken, we determine the long-term behavior of open curves with fixed endpoints evolving in certain convex domains on surfaces of const…
We prove a comparison theorem for the isoperimetric profiles of simple closed curves evolving by the normalized curve shortening flow: If the isoperimetric profile of the region enclosed by the initial curve is greater than that of some `model' convex region with exactly four vertices and with reflection symmetry in bo…
dCMF models evolving patterns in multiway data with temporal dynamics.
problem Capturing evolving patterns in multiway datasets with temporal dependencies.
method Time-aware coupled factorization model constrained by LDS structure.
result dCMF outperforms alternatives in capturing complex dynamics.
Abstract: Study of surface transitions and IDE inflections via contact geometry.
problem Understanding transitions on surfaces and implicit differential equations.
method Contact geometry and Legendrian properties of projections.
result List of unavoidable local phenomena on surfaces and IDE solutions.
CausalEvolve improves efficiency and discovery in open-ended scientific tasks.
problem Lack of targeted guidance and knowledge organization in evolve-based agents.
method Causal scratchpad that identifies and reasons about guiding factors for evolution.
result Effective improvement in evolutionary efficiency and better solutions.
SDF adapts Deep Forest for evolving data streams with active learning.
problem Adapting Deep Forest for evolving data streams.
method Streaming Deep Forest (SDF) with Augmented Variable Uncertainty (AVU) active learning.
result SDF with AVU outperforms other methods trained with all instances by 70% labeling budget.
Duel-Evolve uses LLM self-preferences for test-time optimization of discrete outputs.
problem Optimizing LLM outputs at test time with limited or unreliable scalar rewards.
method Duel-Evolve uses pairwise comparisons from the LLM to guide optimization, aggregating them via a Bayesian Bradley-Terry model.
result Achieves significant improvement over existing methods in accuracy.
STAD adapts models to evolving time-based data shifts.
problem Gradual distribution shifts over time challenge existing test-time adaptation methods.
method Bayesian filtering method that learns time-varying dynamics in hidden features.
result STAD excels in handling small batch sizes and label shift on real-world data.
We study convex entire graphs evolving with normal velocity equal to a positive power of the mean curvature. Under mild assumptions we prove longtime existence.
How can we effectively encode evolving information over dynamic graphs into low-dimensional representations? In this paper, we propose DyRep, an inductive deep representation learning framework that learns a set of functions to efficiently produce low-dimensional node embeddings that evolves over time. The learned embe…
New framework for online control in evolving populations.
problem Control of evolving populations in real-world conditions.
method Online control framework for linear and non-linear dynamical systems.
result Near-optimal regret bounds for gradient-based controllers.
Artificial neural networks are simple and efficient machine learning tools. Defined originally in the traditional setting of simple vector data, neural network models have evolved to address more and more difficulties of complex real world problems, ranging from time evolving data to sophisticated data structures such …
Modeling regime shifts in co-evolving time series with interactions and time-dependency.
problem Discovering and modeling regime shifts in multiple time series with relationships and time-dependent behaviors.
method Modeling interactions and time-dependency in co-evolving time series using a mapping grid and dynamic network representation for regime identification and time-dependent Cox regression for regime transition probabilities.
result A principled approach for modeling interactions and time-dependency in co-evolving time series.
New approach for feature evolution in streaming data with limited storage.
problem Rarely-provided labels in feature evolving streams.
method Incorporates manifold regularization and a buffer to adapt to different storage budgets.
result Preserves the performance of feature evolving learning across different storage budgets.
Distance between evolving hypersurfaces is a PDE solution.
problem Tracking the distance between evolving hypersurfaces.
method Elliptic and parabolic PDEs, mean curvature flow.
result Local Harnack inequalities for the distance between evolving hypersurfaces.
Click-through rate~(CTR) prediction, whose goal is to estimate the probability of the user clicks, has become one of the core tasks in advertising systems. For CTR prediction model, it is necessary to capture the latent user interest behind the user behavior data. Besides, considering the changing of the external envir…
CDLEEDS detects local changes in evolving data streams for accurate feature attributions.
problem Local feature attributions become obsolete in evolving data streams.
method CDLEEDS, a flexible framework for detecting local change and concept drift.
result CDLEEDS reliably detects both local and global concept drift.
Novel algorithm solves optimal transport using evolving probability distributions and convolution.
problem Sample-based optimal transport problem.
method Adversarial formulation with convolution of adaptive kernel and evolving measure.
result Algorithm robust to dimensionality and produces complex maps.
Develops a method to construct entire minimal graphs of odd dimensions.
problem Constructing entire minimal graphs of odd dimensions and arbitrary codimensions.
method Evolving-plane ansatz reducing minimal surface system to geodesic equation on Grassmannian.
result Yields a rich family of explicit entire minimal graphs of odd dimension and arbitrary codimension.
Improved detection of burnt areas in satellite images using evolved hyper-features.
problem Radiometric variations across satellite images and different datasets.
method Understanding feature spaces, training on multi-image datasets, evolving hyper-features, and optimizing for different classifiers.
result Training on multi-image datasets improves model generalization, and evolved hyper-features enhance classifier performance.
A new method constrains PARAFAC2 for better pattern recovery.
problem Challenges in analyzing multi-way measurements with variations across one mode.
method AO-ADMM approach to fit PARAFAC2 model with flexible constraints.
result The proposed method allows for flexible constraints, recovers patterns accurately, and is computationally efficient.