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…
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,695 papers · 148 categories
Trend · papers per month
48 results for “evolvability”
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.
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.
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.
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…
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…
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.
Although Deep Neural Networks have seen great success in recent years through various changes in overall architectures and optimization strategies, their fundamental underlying design remains largely unchanged. Computational neuroscience on the other hand provides more biologically realistic models of neural processing…
Stochastic Partial Differential Equations on Evolving Surfaces and Evolving Riemannian Manifoldsmath.AP
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.
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…
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.
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.
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.
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.
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.
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.
New method for learning evolving tasks with performance guarantees.
problem Learning tasks in a sequence with evolving similarity.
method Adaptable learning methodology with performance guarantees.
result Improved performance in multiple scenarios with reliable guarantees.
Paper proves conjecture about star-shaped curves evolving under GAPF, but not always preserves star shape.
problem What conditions guarantee global existence of Gage's area-preserving flow for nonconvex initial curves?
method Using Dittberner's singularity analysis theory, constructed a ``flying wing'' curve to show limitations.
result Gage's area-preserving flow does not always preserve star-shapedness of evolving curves.
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.
Most transport theorems---that is, a formula for the rate of change of an integral in which both the integrand and domain of integration depend on time---involve domains that evolve according to a flow map. Such domains are said to be convecting. Here a transport theorem for nonconvecting domains evolving on an embedde…
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.
Paper presents IMRCs for evolving tasks with forward and backward learning.
problem Incremental learning of evolving tasks with few samples per task.
method Incremental minimax risk classifiers (IMRCs) that exploit forward and backward learning.
result IMRCs provide significant performance improvement, especially with reduced sample sizes.
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.
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.
Anisotropic obstacle problems and Stefan problem studied with evolving surfaces.
problem Anisotropic parabolic obstacle problems and Stefan problem.
method Cahn-Hoffman transform and anisotropic mean curvature flow.
result Optimal regularity of the solution and -regularity of the evolving free boundary.
GraphKKE learns fixed-length feature vectors from time-evolving graphs of human microbiome data.
problem Understanding dynamic changes in human microbiome graphs over time.
method Spectral analysis of transfer operators and graph kernels.
result GraphKKE captures temporal changes in human microbiome graphs.
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.
Flow deforms locally convex curves into target curves.
problem Deforming locally convex curves to target curves with same elastic energy.
method Curvature flow with nonlocal term to evolve curves.
result Flow deforms curves to target curves if elastic energies match.
EggNet: An Evolving Graph-based Graph Attention Network for Particle Track Reconstructionphysics.data-an
EggNet reconstructs particle tracks from hits using evolving graph attention networks.
problem Particle track reconstruction is computationally expensive and combinatorial.
method EggNet uses a one-shot object condensation approach with evolving graph attention networks.
result EggNet outperforms methods requiring fixed input graphs on TrackML dataset.
The importance of nodes in a network constantly fluctuates based on changes in the network structure as well as changes in external interest. We propose an evolving teleportation adaptation of the PageRank method to capture how changes in external interest influence the importance of a node. This framework seamlessly g…
Commissioned by MIT's in-house artist Jane Philbrick, we evolve an abstract 2D surface (resembling Marta Pan's 1961 "Sculpture Flottante I") under mean curvature, all the while calculating the eigenmodes and eigenvalues of the Laplace-Beltrami operator on the resulting shapes. These are then synthesized into a sound-wa…
Convex curves evolve into circles over time.
problem Deforming convex curves into circles.
method Generalized length-preserving flow for convex curves.
result Convex curves evolve into circles over time.
In this paper, we consider a new length preserving curve flow for convex curves in the plane. We show that the global flow exists, the area of the region bounded by the evolving curve is increasing, and the evolving curve converges to the circle in C-infinity topology as t goes to infinity.
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 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…
The paper extends a Harnack inequality to noncompact evolving hypersurfaces.
problem Proving a Harnack inequality for noncompact evolving hypersurfaces.
method Using a differential Harnack inequality for noncompact convex hypersurfaces flowing with normal speed based on their principal curvatures.
result The extension of Andrews' result to noncompact hypersurfaces.
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…
The paper derives Harnack inequalities for evolving Riemannian manifolds without dimensionality restrictions.
problem Deriving Harnack inequalities for geometric flows with evolving metrics.
method Probabilistic representation of conjugate semigroups and supercontractivity.
result Established dimension-free Harnack inequalities for geometric flows.
Study mean curvature flow into evolving manifold with coupled flows.
problem Analyzing mean curvature flow in evolving Riemannian manifolds.
method Coupling Ricci flow and harmonic map heat flow, calculating variations, and using Harnack expressions.
result Obtained a Huisken monotonicity-type formula for mean curvature flow.
The paper estimates the volume of singular points in evolving surfaces.
problem Estimating the volume of singular points in evolving surfaces.
method Uniform and sharp volume estimates for singular sets of mean curvature flows.
result Uniform and sharp volume estimates for singular sets of mean curvature flows.
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.
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.
Study on spectral stability of an embedded annulus under curve shortening and Ricci flows.
problem Spectral stability of Dirichlet eigenvalues on an evolving annulus.
method Variational formulas, Rellich-type identities, and harmonic capacity methods.
result Established quantitative bounds comparing the spectrum of the evolving annulus with a flat cylinder.
For an ancient solution of the mean curvature flow, we show that each time slice M_t is contained in an affine subspace with dimension bounded in terms of the density and the dimension of the evolving submanifold. Recall that an ancient solution is a family M_t that evolves under mean curvature flow for all negative ti…
A new method simulates large, diverse populations of learning agents evolving in games.
problem Limited scalability and efficiency of Multi-Agent Reinforcement Learning.
method Parallelizable implementation of Policy Gradient and Opponent-Learning Awareness for evolutionary simulations.
result Simulated large, diverse populations of learning agents evolve under various strategies.
Inverse curvature flows shape star-shaped hypersurfaces into spheres.
problem Evolution of star-shaped hypersurfaces inside a convex cone.
method Inverse curvature flows, convexity of the cone, gradient and Hölder estimates.
result Hypersurfaces converge to a round sphere as time goes to infinity.