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

Trend · papers per month

4284125167 · Jun 202019922001200920172026
48 results for symmetric environments

A framework for learning disentangled representations of symmetric environments.

problem Discovering and modelling the underlying structure of environments.
method Group representation theory for disentangled representations of dynamical environments.
result Our method enables accurate long-horizon predictions and correlates with disentanglement quality.

Framework uncovers symmetric and asymmetric species associations from data.

problem Retrieving bidirectional species associations from co-occurrence data.
method Machine learning framework modeling latent embeddings and joint generative model.
result Framework successfully recovers known symmetric and asymmetric associations.

Transfer learning benefits vary in DRL, affecting representation and policy learning.

problem Understanding how much of DRL's sample complexity is due to representation learning.
method Transfer learning experiments comparing performance on related games.
result Benefits of transfer learning are highly variable and non-symmetric across tasks.

Recent reinforcement learning algorithms, though achieving impressive results in various fields, suffer from brittle training effects such as regression in results and high sensitivity to initialization and parameters. We claim that some of the brittleness stems from variance differences, i.e. when different environmen…

2019-05-24abs ↗pdf ↗

Novel unsupervised MIG detectors improve signal detection in cluttered environments.

problem Signal detection in nonhomogeneous clutter environments.
method Developed novel discriminative MIG detectors using HPD matrices and geometric measures.
result Improved signal detection performance compared to conventional methods.

In this paper we propose a highly efficient and very accurate deep learning method for estimating the propagation pathloss from a point xx (transmitter location) to any point yy on a planar domain. For applications such as user-cell site association and device-to-device link scheduling, an accurate knowledge of the p…

2019-11-17abs ↗pdf ↗

OBSER framework infers sub-environments from objects, outperforming scene-based methods.

problem Zero-shot recognition of environments from object distributions.
method Bayesian framework using metric and self-supervised learning models to estimate object distributions in latent space.
result OBSER framework reliably performs inference in open-world and photorealistic environments, outperforming scene-based methods.

New approach handles stochastic and partially-observable environments using discrete autoencoders and Monte Carlo tree search.

problem Challenges in planning for stochastic and partially-observable environments.
method Uses discrete autoencoders and a stochastic variant of Monte Carlo tree search.
result Significantly outperforms MuZero on stochastic chess and scales to DeepMind Lab.

This paper introduces CENIE to quantify environment novelty for better UED.

problem Challenges in measuring environment novelty for effective UED.
method CENIE framework using state-action space coverage and Gaussian Mixture Models.
result CENIE improves UED performance across multiple benchmarks.

Infinite hierarchical contrastive clustering identifies personal environments linked to health outcomes.

problem Identifying meaningful relationships between environmental features and health outcomes on an individual level.
method Contrastive clustering framework with stick-breaking prior and participant-specific prediction loss.
result Model effectively identifies distinct personal environments and groups them into meaningful types linked to health outcomes.

Research shows collective learning across diverse environments is hard due to privacy and security concerns.

problem Privacy, security, and equity concerns restrict information sharing in diverse AI environments.
method Characterized learning algorithms as choice correspondences, provided minimum requirements for rational learning algorithms.
result The only rational learning algorithm in heterogeneous environments is unilaterally learning from a single environment without information sharing.

LEADS improves model generalization across different environments.

problem Modeling dynamical systems from varied environments leads to biased or scarce solutions.
method LEADS learns a shared model capturing common dynamics and additional terms for environment-specific dynamics.
result LEADS improves model generalization for both known and novel environments.

PSRL extension for continuing environments reduces regret.

problem Formalizing and analyzing resampling approach for reinforcement learning.
method Continuing PSRL maintains a model of the environment and replaces it with samples from the posterior distribution.
result Established an ildeO(τSAT) ilde{O}(τS \sqrt{A T}) bound on Bayesian regret.

The paper classifies symmetric triads with multiplicities and their applications.

problem Classifying symmetric triads with multiplicities and their applications.
method Developed the theory of symmetric triads with multiplicities, classified abstract triads, and determined corresponding triads for commutative compact triads.
result Classified symmetric triads with multiplicities and their applications.

New method learns robust representations by modeling environment variation.

problem Learning invariant representations across varying environments.
method Explicitly modeling variation across environments and marginalizing it out.
result Proposed method outperforms invariant-learning methods in various settings.

GALA framework learns invariant graph representations via environment augmentation with minimal assumptions.

problem Learning invariant graph representations from different environments without additional assumptions.
method Developed GALA framework with minimal assumptions of variation sufficiency and consistency. Uses an assistant model to differentiate graph environment changes.
result Extracting maximally invariant subgraphs to proxy predictions identifies underlying invariant subgraphs for successful out-of-distribution generalization.

Reinforcement learning (RL) methods learn optimal decisions in the presence of a stationary environment. However, the stationary assumption on the environment is very restrictive. In many real world problems like traffic signal control, robotic applications, one often encounters situations with non-stationary environme…

2019-05-10abs ↗pdf ↗

In this article, we summarize the results on symmetric conformal geometries. We review the results following from the general theory of symmetric parabolic geometries and prove several new results for symmetric conformal geometries. In particular, we show that each symmetric conformal geometry is either locally flat or…

2015-03-09abs ↗pdf ↗

We discuss a variant of Thompson sampling for nonparametric reinforcement learning in a countable classes of general stochastic environments. These environments can be non-Markov, non-ergodic, and partially observable. We show that Thompson sampling learns the environment class in the sense that (1) asymptotically its …

2016-02-25abs ↗pdf ↗

ATLAS separates invariant and transferable latent factors across diverse environments.

problem Transfer learning and robust prediction in heterogeneous environments.
method ATLAS leverages invariance principle to disentangle latent factors and uses auxiliary labels for robust prediction.
result Near-oracle performance and robust transferable prediction in new environments.

Researchers use DT to transfer policies from one environment to another using causal reasoning.

problem Adapting to changes in environmental dynamics in reinforcement learning.
method Applying causal counterfactual reasoning to Decision Transformer (DT) architecture for policy transfer.
result DT successfully transfers a learned policy to new environments while retaining most of the reward.

Symmetric Poisson structures linked to geodesic foliations and Jordan algebras.

problem Understanding geometric structures related to geodesic foliations and dynamics.
method Introducing symmetric Poisson structures, proving correspondences with geodesic foliations and Jordan algebras.
result Symmetric Poisson structures correspond to totally geodesic foliations and Jacobi-Jordan algebras.