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

Trend · papers per month

0.4%0.8%1.2%1.6% · Jul 200119922001200920172026
48 results for Caste

CAST models time-varying treatment effects in cancer patients.

problem Estimating treatment effects at fixed time points limits understanding of dynamic changes over time.
method CAST combines parametric and non-parametric methods to model continuous time-varying treatment effects.
result CAST reveals how treatment effects rise, peak, and decline over the follow-up period.

CAST package aids in spatial prediction models using machine learning.

problem Challenges in applying machine learning for spatial data.
method Developed cross-validation strategies, spatial feature selection, and area of applicability assessment methods.
result Supports more reliable spatial predictions through CAST package.

CAST improves spectral clustering for multi-scale data by integrating reachability similarity.

problem Applying spectral clustering to multi-scale data where clusters vary in size and density.
method CAST integrates reachability similarity with distance-based similarity to derive a coefficient matrix, then applies trace Lasso regularization.
result CAST provides excellent performance and robustness across various multi-scale data test cases.

CAST predicts distribution-valued time series by stabilizing and transporting simplex-supported successors.

problem Forecasting distribution-valued time series with structural failure modes.
method CAST (Causal Anchored Simplex Transport) uses successors retrieved from causal context, stabilized with a persistence anchor, and locally transported on ordered supports.
result CAST outperforms baselines on eleven public and simulated benchmarks, achieving best average rank on both one-step KL and autoregressive rollout JSD.

Cohomology fractals are visual representations of cohomology classes on hyperbolic 3-manifolds.

problem Visualizing cohomology classes on hyperbolic 3-manifolds.
method Cohomology fractals are images associated to cohomology classes. They are related to limit sets of Kleinian groups but differ in key aspects. An implementation using ideal triangulations and ray-casting is presented.
result Cohomology fractals allow for real-time zooming in any direction at arbitrary depth.

NMF identifies hidden component processes from thermal manufacturing data.

problem Thermal manufacturing processes with many interacting parameters are hard to diagnose.
method Non-negative matrix factorization guided by a knowledge-based initialization strategy.
result Identifies physical meaningful sources from temperature time series.

In the early phases of the product life cycle, the costs controls became a major decision tool in the competitiveness of the companies due to the world competition. After defining the problems related to this control difficulties, we will present an approach using a concept of cost entity related to the design and real…

2010-11-26abs ↗pdf ↗

U-Cast simplifies AI weather forecasting with a standard U-Net and efficient training.

problem Complex AI models limit accessibility and cost for weather forecasting.
method Simple U-Net backbone, deterministic pre-training, and probabilistic fine-tuning with Monte Carlo Dropout.
result U-Cast matches or exceeds state-of-the-art models in accuracy while reducing training and inference costs.

Representations of data that are invariant to changes in specified factors are useful for a wide range of problems: removing potential biases in prediction problems, controlling the effects of covariates, and disentangling meaningful factors of variation. Unfortunately, learning representations that exhibit invariance …

2018-05-24abs ↗pdf ↗

A variational equation of the fourth order for the free relativistic top is developed starting from the Dixon's system of equations for the motion of the relativistic dipole. The obtained equation is then cast into the homogeneous space-time Hamiltonian form.

2015-10-21abs ↗pdf ↗

Adjoint Matching improves flow and diffusion models with reward fine-tuning.

problem Improving generative models with reward fine-tuning.
method Casting reward fine-tuning as stochastic optimal control (SOC) and enforcing a specific noise schedule.
result Adjoint Matching outperforms existing SOC algorithms.

This paper shows that a simple baseline based on a Bag-of-Words (BoW) representation learns surprisingly good knowledge graph embeddings. By casting knowledge base completion and question answering as supervised classification problems, we observe that modeling co-occurences of entities and relations leads to state-of-…

2017-10-30abs ↗pdf ↗

We give a physical derivation of generalized Kahler geometry. Starting from a supersymmetric nonlinear sigma model, we rederive and explain the results of Gualtieri regarding the equivalence between generalized Kahler geometry and the bi-hermitean geometry of Gates-Hull-Rocek. When cast in the language of supersymmetri…

2006-03-16abs ↗pdf ↗

We analyze a nonlinear equation proposed by F. Black (1968) for the optimal portfolio function in a log-normal model. We cast it in terms of the risk tolerance function and provide, for general utility functions, existence, uniqueness and regularity results, and we also examine various monotonicity, concavity/convexity…

2017-05-21abs ↗pdf ↗

Clustering high-dimensional data often requires some form of dimensionality reduction, where clustered variables are separated from "noise-looking" variables. We cast this problem as finding a low-dimensional projection of the data which is well-clustered. This yields a one-dimensional projection in the simplest situat…

2016-08-29abs ↗pdf ↗

We give an interpretation of the maximal number of linearly independent vector fields on spheres in terms of the Spin(9) representation on R^16. This casts an insight on the role of Spin(9) as a subgroup of SO(16) on the existence of vector fields on spheres, parallel to the one played by complex, quaternionic and octo…

2011-07-03abs ↗pdf ↗

Probabilistic learning for binary classification with categorical variables.

problem Binary classification with categorical covariates.
method Probabilistic analysis and two algorithms for learning boolean functions.
result Effective learning of boolean functions from binary data.

Using very weak criteria for what may constitute a noncommutative geometry, I show that a pseudo-Riemannian manifold can only be smoothly deformed into noncommutative geometries if certain geometric obstructions vanish. These obstructions can be expressed as a system of partial differential equations relating the metri…

2002-11-13abs ↗pdf ↗

An active area of research is to increase the safety of self-driving vehicles. Although safety cannot be guarenteed completely, the capability of a vehicle to predict the future trajectories of its surrounding vehicles could help ensure this notion of safety to a greater deal. We cast the trajectory forecast problem in…

2019-02-09abs ↗pdf ↗

We reexamine from first principles the classical Goldberg-Sachs theorem from General Relativity. We cast it into the form valid for complex metrics, as well as real metrics of any signature. We obtain the sharpest conditions on the derivatives of the curvature that are sufficient for the implication (integrability of a…

2009-11-17abs ↗pdf ↗

In this paper we cast the well-known convolutional neural network in a Gaussian process perspective. In this way we hope to gain additional insights into the performance of convolutional networks, in particular understand under what circumstances they tend to perform well and what assumptions are implicitly made in the…

2018-10-25abs ↗pdf ↗

It is well-known that sigma-models with symmetric target spaces are classically integrable. At the example of the model with target space the flag manifold U(3)/U(1)^3 -- a non-symmetric space -- we show that the introduction of torsion allows to cast the equations of motion in the form of a zero-curvature condition fo…

2014-12-11abs ↗pdf ↗

We introduce general scattering transforms as mathematical models of deep neural networks with l2 pooling. Scattering networks iteratively apply complex valued unitary operators, and the pooling is performed by a complex modulus. An expected scattering defines a contractive representation of a high-dimensional probabil…

2013-06-24abs ↗pdf ↗

Keyphrase boundary classification (KBC) is the task of detecting keyphrases in scientific articles and labelling them with respect to predefined types. Although important in practice, this task is so far underexplored, partly due to the lack of labelled data. To overcome this, we explore several auxiliary tasks, includ…

2017-04-03abs ↗pdf ↗

The classical approach to inverse problems is based on the optimization of a misfit function. Despite its computational appeal, such an approach suffers from many shortcomings, e.g., non-uniqueness of solutions, modeling prior knowledge, etc. The Bayesian formalism to inverse problems avoids most of the difficulties en…

2014-10-21abs ↗pdf ↗

In ranking problems, the goal is to learn a ranking function from labeled pairs of input points. In this paper, we consider the related comparison problem, where the label indicates which element of the pair is better, or if there is no significant difference. We cast the learning problem as a margin maximization, and …

2014-01-30abs ↗pdf ↗

EVARS-GPR refines Gaussian Process Regression for seasonal data with sudden scale changes.

problem Challenges in forecasting with changing system behavior over time.
method Combines online change point detection with data augmentation for refitting.
result 20.8% lower RMSE on real-world datasets compared to similar methods.

In this paper we formulate a probabilistic model for class-specific discriminant subspace learning. The proposed model can naturally incorporate the multi-modal structure of the negative class, which is neglected by existing class-specific methods. Moreover, it can be directly used to define a class-specific probabilis…

2018-12-14abs ↗pdf ↗

We consider the inverse problem of reconstructing the posterior measure over the trajec- tories of a diffusion process from discrete time observations and continuous time constraints. We cast the problem in a Bayesian framework and derive approximations to the posterior distributions of single time marginals using vari…

2015-12-18abs ↗pdf ↗

We review a simple model of closed economy, where the economic agents make money transactions and a saving criterion is present. We observe the Gibbs distribution for zero saving propensity, and non-Gibbs distributions otherwise. While the exact solution in the case of zero saving propensity is already known to be give…

2003-12-05abs ↗pdf ↗

Quantum flag manifold σ-models are integrable and satisfy Ricci flow equations.

problem Integrating quantum flag manifold σ-models with fermions.
method Gauging bosonic Thirring/Gross-Neveu-type systems, adding fermions to cancel anomalies, and checking Ricci flow equations.
result Trigonometrically deformed geometries of flag manifold σ-models satisfy generalized Ricci flow equations.

Paper introduces new neural network models and theories.

problem Understanding neural networks beyond over-parameterized regime.
method Develops two exact models and a novel representor theory.
result Provides insights into neural network training and kernel evolution.

Study finds optimal vocabulary size for neural machine translation.

problem Imbalanced class distribution in language data affects NMT performance.
method Casts NMT as a classification task, analyzes vocabulary sizes, and tests multiple languages.
result Certain vocabulary sizes outperform others, explaining NMT performance.

We revisit the problem of inferring the overall ranking among entities in the framework of Bradley-Terry-Luce (BTL) model, based on available empirical data on pairwise preferences. By a simple transformation, we can cast the problem as that of solving a noisy linear system, for which a ready algorithm is available in …

2016-05-09abs ↗pdf ↗

Optimizes Gaussian process hyperparameters using Bayesian autoregression.

problem Optimizing hyperparameters for Matérn kernel temporal Gaussian processes.
method Recursive Bayesian estimation for autoregressive parameters.
result Outperforms traditional optimization methods in runtime and accuracy.

Given a set of observations generated by an optimization process, the goal of inverse optimization is to determine likely parameters of that process. We cast inverse optimization as a form of deep learning. Our method, called deep inverse optimization, is to unroll an iterative optimization process and then use backpro…

2018-12-03abs ↗pdf ↗