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

158317475633 · Jun 202019922001200920172026
48 results for task profiling

Generative profiling improves real-time task timing for varied resource contexts.

problem Inaccurate task timing analysis for complex hardware architectures.
method Nonparametric, conditional multi-marginal Schrödinger Bridge (MSB) formulation for synthesizing context-dependent timing profiles.
result Maximum likelihood accurate execution profiles for unseen resource contexts.

Paper tackles graph class-incremental learning with task profiling and prompting.

problem Challenges in separating classes from different tasks in graph CIL.
method Laplacian smoothing-based task profiling and graph prompting approach.
result 100% task ID prediction accuracy and significant performance improvement.

A new framework for adaptive behavior using reusable value profiles.

problem Adaptive behavior in changing environments requires switching among value-control regimes, but maintaining separate parameters for each situation is impractical.
method Introduces value profiles: reusable bundles of parameters assigned to hidden states, allowing for state-conditional strategy recruitment without independent parameters for each context.
result Profile-based models outperform simpler alternatives in probabilistic reversal learning, suggesting belief-dependent control of adaptive behavior.

Analysis of somatic mutation profiles from cancer patients is essential in the development of cancer research. However, the low frequency of most mutations and the varying rates of mutations across patients makes the data extremely challenging to statistically analyze as well as difficult to use in classification probl…

2019-11-20abs ↗pdf ↗

Random layer-wise pruning profiles are as effective as metric-based ones for various datasets.

problem Reduction of model size and computational resources in neural networks.
method Conducted baseline experiments, developed RL-based search algorithm for finding transferable layer-wise pruning profiles.
result RL-based layer-wise pruning profiles are as good or better than best profiles found on the original dataset via exhaustive search.

Model trains agents to optimize saving and investment strategies for diverse retirement needs.

problem Optimal saving and investment strategies for individuals in varied employment and income profiles.
method Deep reinforcement learning to train intelligent agents with heterogeneous profiles.
result Flexible methodology estimates lifetime consumption and investment choices for different profiles.

New method for unbinned, profiled unfolding in particle physics.

problem Traditional unfolding methods are limited in the number of unfolded variables and cannot profile nuisance parameters.
method Proposes a machine learning-based method that allows for unbinned differential cross sections and profiles nuisance parameters.
result Demonstrates the method with Gaussian examples and a simulated Higgs boson cross section measurement.

We propose Style Conditioned Recommendations (SCR) and introduce style injection as a method to diversify recommendations. We use Conditional Variational Autoencoder (CVAE) architecture, where both the encoder and decoder are conditioned on a user profile learned from item content data. This allows us to apply style tr…

2019-07-25abs ↗pdf ↗

Machine learning detects subtle glucose changes for early diabetes diagnosis.

problem Challenging early-stage diabetes diagnosis due to subtle glucose changes.
method Applied machine learning to synthetic glucose profiles generated by a biophysical model.
result High accuracy (above 85%) in detecting insulin resistance using various neural networks.

Profile entropy measures learnability and compressibility of discrete distributions.

problem Understanding the learnability and compressibility of discrete distributions.
method Investigates profile entropy, showing its role in estimation, inference, and compression.
result Profile entropy is a fundamental measure unifying estimation, inference, and compression.

Method controls extrapolation in prediction profiles for statistical and machine learning models.

problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.

We equip many non compact non simply connected surfaces with smooth Riemannian metrics whose isoperimetric profile is smooth, a highly non generic property. The computation of the profile is based on a calibration argument, a rearrangement argument, the Bol-Fiala curvature dependent inequality, together with new result…

2007-01-07abs ↗pdf ↗

We introduce a spectrum of monotone coarse invariants for metric measure spaces called Poincaré profiles. The two extremes of this spectrum determine the growth of the space, and the separation profile as defined by Benjamini--Schramm--Timár. In this paper we focus on properties of the Poincaré profiles of groups with …

2017-07-07abs ↗pdf ↗

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.

Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.

problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.

Study compares isoperimetric profiles on manifolds with integral Ricci curvature bounds.

problem Comparing isoperimetric profiles on manifolds with integral Ricci curvature bounds.
method Extending previous work, the study uses integral bounds on Ricci curvature to prove comparison results for isoperimetric profile functions.
result Comparison results for the Isoperimetric profile function in manifolds with integral bounds on Ricci curvature.

Paper proposes LCP for structural encodings, outperforming existing methods.

problem Improving Graph Neural Networks performance through effective structural encodings.
method Geometric perspective, Local Curvature Profiles (LCP) for structural encodings, combining with global positional encodings, comparing with rewiring techniques.
result LCP significantly outperforms existing structural encodings and combining LCP with global positional encodings improves performance.

Estimates lower bounds for isoperimetric profiles and improves on previous estimates for specific manifolds.

problem Estimating lower bounds for isoperimetric profiles of specific Riemannian manifolds.
method Explicit lower bounds for isoperimetric profiles of Riemannian product manifolds.
result Improved lower bounds for isoperimetric profiles and Yamabe constants.

In the context of sub-Riemannian Heisenberg groups Hn, n \geq 1, we shall study Isoperimetric Profiles, which are closed compact hypersurfaces having constant horizontal mean curvature, very similar to ellipsoids. Our main goal is to study the stability of Isoperimetric Profiles.

2011-10-04abs ↗pdf ↗

Paper describes profiles of multivariate normal distributions and novel estimators for mutual information.

problem Estimating mutual information for complex distributions.
method Analytical description of profiles, introduction of Bend and Mix Models, Monte Carlo estimation.
result Bend and Mix Models accurately estimate mutual information profiles and provide Bayesian estimates.

We study risk-sensitive imitation learning where the agent's goal is to perform at least as well as the expert in terms of a risk profile. We first formulate our risk-sensitive imitation learning setting. We consider the generative adversarial approach to imitation learning (GAIL) and derive an optimization problem for…

2018-08-13abs ↗pdf ↗

The study analyzes how large language models form and express investor risk profiles.

problem Understanding how large language models (LLMs) form and express investor risk profiles.
method Examined three LLMs (GPT, Gemini, and Llama) and assessed their responses to a standardized risk questionnaire under varying prompts.
result LLMs generally form long-term investment profiles, but they exhibit different risk tolerance levels.

The hypercube's perimeter is significantly larger than expected near half volume.

problem Understanding the isoperimetric profile of the hypercube.
method Analytical proof of perimeter bounds and comparison to Gaussian isoperimetric profile.
result The isoperimetric profile of the hypercube does not converge to the Gaussian profile as dimension increases.

With the maturation of metabolomics science and proliferation of biobanks, clinical metabolic profiling is an increasingly opportunistic frontier for advancing translational clinical research. Automated Machine Learning (AutoML) approaches provide exciting opportunity to guide feature selection in agnostic metabolic pr…

2017-10-09abs ↗pdf ↗

We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry plane. We show that such profiles are in a one-parameter family of curves which w…

2009-07-29abs ↗pdf ↗

This research adapts superpixels for Shapley value computation in DNA profile classification.

problem Efficiently computing Shapley values for large, multidimensional time-series data.
method Adapting the concept of superpixels to streamline Shapley value computation for time-series-like data.
result Realistic, accurate, and fast computation of Shapley values for DNA profile classification.

Develops a method to disaggregate aerosol optical depth into vertical extinction profiles.

problem Uncertainty in measuring aerosol vertical distributions due to limited observations.
method Bayesian nonparametric Gaussian process modeling using meteorological predictors.
result Model reconstructs realistic extinction profiles with well-calibrated uncertainty, outperforming idealized baselines.