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

2579 · Oct 202419922001200920172026
48 results for SIM(2)

Single Index Models (SIMs) are simple yet flexible semi-parametric models for classification and regression. Response variables are modeled as a nonlinear, monotonic function of a linear combination of features. Estimation in this context requires learning both the feature weights, and the nonlinear function. While met…

2015-06-30abs ↗pdf ↗

Paper tackles sim-to-real transfer in continuous domains with partial observations.

problem Lack of theoretical foundation for sim-to-real transfer in continuous domains with partial observations.
method Developed a new algorithm for infinite-horizon average-cost LQGs and established a regret bound.
result A popular robust adversarial training algorithm can learn competitive policies from simulation to real-world environments.

A Sim(n-1,1) affine manifold is an affine manifold whose linear holonomy is contained in the similarity lorentzian group but not in the lorentzian group. The class of similarity lorentzian affine manifolds is a small part in the nice class of conformally lorentzian flat manifolds. In this paper we show that a compact S…

2002-07-06abs ↗pdf ↗

Survey examines challenges and solutions in sim-to-real transfer for robotics.

problem Challenges in transferring robotic systems from simulation to real-world environments.
method Leveraging techniques like domain randomization, real-to-sim transfer, state and action abstractions, and sim-real co-training.
result Promising results in closing the reality gap across various robotic domains.

The identification of slow invariant manifolds (SIMs) is an essential part in model-order reduction for reactive systems. The mathematical definition of the SIM by Fenichel can be considered unsatisfactory, because it is only applicable to so-called slow-fast system and does not provide the uniqueness of the SIM. Obser…

2019-05-06abs ↗pdf ↗

For every   b>1  \;b>1\; fixed, we explicitly construct 11-dimensional families of embedded constrained Willmore tori parametrized by their conformal class   (a,b)\;(a,b)\; with   ab0+  \; a \sim_b 0^+\; deforming the homogenous torus \;fbf^b of conformal class \;(0,b).(0,b). The variational vector field at fbf^b is hereby given by a non…

2019-02-25abs ↗pdf ↗

Paper simplifies complex causal identifiability problems with exogenous isomorphism.

problem Achieving consistent answers to causal questions in Structural Causal Models.
method Introducing exogenous isomorphism and proposing EI\sim_{\mathrm{EI}}-identifiability.
result Unified and generalized theories for practical applications in counterfactual reasoning.

G-Sim uses LLMs to build reliable simulators for complex systems.

problem Building robust simulators for critical domains like healthcare and logistics is challenging.
method Hybrid framework combining LLM-driven structural design and empirical calibration.
result G-Sim produces reliable, causally-informed simulators that handle non-differentiable and stochastic simulators.

Using the Generalised Lotka Volterra (GLV) model adapted to deal with muti agent systems we can investigate economic systems from a general viewpoint and obtain generic features common to most economies. Assuming only weak generic assumptions on capital dynamics, we are able to obtain very specific predictions for the …

2001-02-23abs ↗pdf ↗

SIM-Shapley improves SV approximation efficiency and stability.

problem High computational costs of Shapley value methods in high-dimensional settings.
method Stochastic Iterative Momentum for Shapley Value Approximation (SIM-Shapley).
result Reduced computation time by up to 85% while maintaining feature attribution quality.

Bayesian optimization adapts domain parameters for more robust robot policies.

problem Learning policies for robot control from simulation data often fails in the real world due to the 'reality gap'.
method Bayesian Domain Randomization (BayRn) uses Bayesian optimization to adapt domain parameter distributions during training.
result BayRn achieves better sim-to-real transfer compared to fixed distribution methods.

Modeling curvature-sensitive cells in visual cortex with geometric structures.

problem Understanding the functional architecture of curvature-sensitive cells in the visual cortex.
method Geometric model based on Engel structure and SIM(2) symmetry.
result Identified SIM(2) as the natural symmetry group for curvature-sensitive cells.

Single Index Models (SIMs) are simple yet flexible semi-parametric models for machine learning, where the response variable is modeled as a monotonic function of a linear combination of features. Estimation in this context requires learning both the feature weights and the nonlinear function that relates features to ob…

2016-03-13abs ↗pdf ↗

Let MM be a smooth compact manifold and PP be either R1R^1 or S1S^1. There is a natural action of the groups Diff(M)Diff(M) and Diff(M)×Diff(P)Diff(M) \times Diff(P) on the space of smooth mappings C(M,P)C^{\infty}(M,P). For fC(M,P)f\in C^{\infty}(M,P) let SfS_f, SMPS_{MP}, OfO_f, and OMPO_{MP} be the stabilizers and orbits of ff under these ac…

2005-03-31abs ↗pdf ↗

SIM models user interests from long sequential behavior data, improving click-through rate prediction.

problem Challenges in capturing user interests with long user behavior sequences.
method SIM uses a cascaded search paradigm with two units: General Search Unit and Exact Search Unit.
result SIM achieves significant CTR and RPM lifts in Alibaba's display advertising system.

Turbo-Sim generates models from physics principles, improving interpretability and flexibility.

problem Transforming particle properties from theory to observation in collider physics.
method Maximizes mutual information between input and output, setting loss term weights.
result Mathematically interpretable and flexible generative models.

Alt-GDA outperforms Sim-GDA in minimax games with near-optimal local convergence.

problem Minimax optimization convergence rate comparison
method Alternating Gradient Descent-Ascent (Alt-GDA) vs. Simultaneous Gradient Descent-Ascent (Sim-GDA)
result Alt-GDA achieves near-optimal local convergence rate for strongly convex-strongly concave problems, while Sim-GDA converges slower.

It is known that for a certain class of single index models (SIMs) Y=f(Xp×1β0,ε)Y = f(\boldsymbol{X}_{p \times 1}^\intercal\boldsymbolβ_0, \varepsilon), support recovery is impossible when XN(0,Ip×p)\boldsymbol{X} \sim \mathcal{N}(0, \mathbb{I}_{p \times p}) and a model complexity adjusted sample size is below a critical threshold. Recen…

2015-11-25abs ↗pdf ↗

Let MM be a smooth closed orientable surface. Let FF be the space of Morse functions on MM, and F1\mathbb{F}^1 the space of framed Morse functions, both endowed with CC^\infty-topology. The space F0\mathbb{F}^0 of special framed Morse functions is defined. We prove that the inclusion mapping $\mathbb{F}^0\hookright…

2011-06-15abs ↗pdf ↗

BoC probe assesses neural network confidence coherence, revealing architecture-specific uncertainty.

problem Poor calibration and OOD detection in neural networks.
method Bag-of-Coins (BoC) probe compares softmax confidence to pairwise dominance probabilities.
result BoC reveals clear ID/OOD separation for some architectures but not others.

New algorithm finds best subset in high-dimensional data models.

problem Finding the best subset of predictors in high-dimensional data models.
method Proposes a scalable algorithm using a generalized information criterion.
result Directly proves consistency and oracle property for the best-subset selection.

This paper presents relations between several types of closedness of a law-invariant convex set in a rearrangement invariant space X\mathcal{X}. In particular, we show that order closedness, σ(X,Xn)σ(\mathcal{X},\mathcal{X}_n^\sim)-closedness and σ(X,L)σ(\mathcal{X},L^\infty)-closedness of a law-invariant convex set in $\mathc…

2018-10-24abs ↗pdf ↗

RL controls small soccer robots in a real league, beating human-designed policies.

problem Training robots to play complex, real-world sports.
method Sim-to-Real RL approach, training in simulated environment, applying to real-world robots.
result Robots learned policies to compete effectively, beating human-designed strategies.

GT estimator shows convergence for Markov samples, improving i.i.d. results.

problem Estimating missing mass in Markov samples.
method Analyzed convergence of Good-Turing estimator for Markov samples, considering spectral properties of transition matrices.
result The convergence of the GT estimator for Markov samples depends on the spectral properties of the transition matrices, leading to a new minimax rate of 1/(nβ5)1/(nβ^5) for rank-2 Markov chains.

This work studies reinforcement learning in the Sim-to-Real setting, in which an agent is first trained on a number of simulators before being deployed in the real world, with the aim of decreasing the real-world sample complexity requirement. Using a dynamic model known as a rich observation Markov decision process (R…

2019-09-23abs ↗pdf ↗

This paper analyzes how diffusion models learn and generalize concepts.

problem Learning and generalizing concepts in compositional data-generating processes.
method Introduced a structured identity mapping (SIM) task to analyze neural network learning dynamics.
result SIM task captures key empirical observations on compositional generalization.

Understanding the structure of financial markets deals with suitably determining the functional relation between financial variables. In this respect, important variables are the trading activity, defined here as the number of trades NN, the traded volume VV, the asset price PP, the squared volatility σ2σ^2, the bid…

2018-03-13abs ↗pdf ↗

Vanilla SGD learns SIM from anisotropic data without explicit covariance estimation.

problem Learning SIM from anisotropic Gaussian inputs.
method Vanilla Stochastic Gradient Descent (SGD) trained on SIM with anisotropic input.
result Vanilla SGD adapts to anisotropic data's covariance structure.

The paper studies the past inextendibility of FLRW spacetimes using the VDR asymptote.

problem Investigating the past inextendibility of FLRW spacetimes.
method Using the volume-distance-ratio (VDR) asymptote to assess spacetime inextendibility criteria.
result Conditions for past inextendibility of FLRW spacetimes are identified.

CLuP achieves near optimal ground state energies for positive and negative Hopfield models.

problem Finding near optimal ground state energies for positive and negative Hopfield models.
method Controlled Loosening-up (CLuP) algorithm with fully lifted random duality theory (fl RDT).
result Achieves ground state free energies of 1.771.77 and 0.330.33 for positive and negative Hopfield models respectively.

New framework aligns latent representations over-the-air using intelligent metasurfaces.

problem Heterogeneous transmitter-receiver models produce misaligned latent representations in semantic communication.
method Intelligent metasurfaces (SIM) emulate supervised and zero-shot semantic aligners directly in the wave domain.
result SIMs achieve up to 90% task accuracy in high SNR regimes, robust to low SNR.

We construct genomic predictors for heritable and extremely complex human quantitative traits (height, heel bone density, and educational attainment) using modern methods in high dimensional statistics (i.e., machine learning). Replication tests show that these predictors capture, respectively, \sim40, 20, and 9 perc…

2017-09-19abs ↗pdf ↗

Given a compact Alexadrov nn-space ZZ with curvature curv κ\ge κ, and let f:ZXf: Z\to X be a distance non-increasing onto map to another Alexandrov nn-space with curv κ\ge κ. The relative volume rigidity conjecture says that if XX achieves the relative maximal volume i.e. vol(Z)=vol(X)vol(Z)=vol(X), then XX is isometric to $…

2011-06-23abs ↗pdf ↗

Let MM be an orientable, irreducible 33-manifold and (V,W;F)(\mathcal{V},\mathcal{W};F) a weakly reducible, unstabilized Heegaard splitting of MM of genus at least three. In this article, we define an equivalent relation \sim on the set of the generalized Heegaard splittings obtained by weak reductions and find special…

2016-07-02abs ↗pdf ↗