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.

169,051 papers · 148 categories

Trend · papers per month

1122 · Aug 201819922001200920172026
21 results for odor pleasantness

Model predicts odor pleasantness using CNN, outperforming manual methods.

problem Predicting odor pleasantness for industry applications.
method Used a convolutional neural network to replace manual feature extraction.
result Shows 90% correlation with human ratings and 99.9% accuracy in categorizing odors.

In recent years, more machine learning algorithms have been applied to odor classification. These odor classification algorithms usually assume that the training datasets are static. However, for some odor recognition tasks, new odor classes continually emerge. That is, the odor datasets are dynamically growing while b…

2018-01-08abs ↗pdf ↗

Graph neural networks improve odor prediction from molecular structure.

problem Predicting odor from molecular structure is challenging and important.
method Used graph neural networks for QSOR modeling.
result Graph neural networks significantly outperform prior methods on a novel data set.

New method improves neural decoding accuracy and reveals latent memory organization.

problem Improving neural decoding of temporal memory organization.
method Bayesian neural decoding using a diversity-encouraging latent representation learning method.
result Substantially higher accuracy in neural decoding and clear latent representation.

TED framework teaches AI to explain decisions, improving accuracy.

problem Providing understandable explanations for AI predictions in high-stakes applications.
method Augmenting training data with explanations from domain users, using embeddings and multi-task learning.
result AI models can be taught to provide meaningful explanations, sometimes improving accuracy.

Let (M,g)(M,g) be a time oriented Lorentzian manifold and dd the Lorentzian distance on MM. The function τ(q):=supp<qd(p,q)τ(q):=\sup_{p< q} d(p,q) is the cosmological time function of MM, where as usual p<qp< q means that pp is in the causal past of qq. This function is called regular iff τ(q)<τ(q) < \infty for all qq and also $τ\to 0…

1997-09-30abs ↗pdf ↗

Quantifying behavior is crucial for many applications in neuroscience. Videography provides easy methods for the observation and recording of animal behavior in diverse settings, yet extracting particular aspects of a behavior for further analysis can be highly time consuming. In motor control studies, humans or other …

2018-04-09abs ↗pdf ↗

We give a rigorous geometric proof of the Murakami-Yano formula for the volume of a hyperbolic tetrahedron. In doing so, we are led to consider generalized hyperbolic tetrahedra, which are allowed to be non-convex, and have vertices `beyond infinity'; and we uncover a group, which we call 22.5K, of 23040 scissors-class…

2003-09-10abs ↗pdf ↗

Filters in convolutional networks are typically parameterized in a pixel basis, that does not take prior knowledge about the visual world into account. We investigate the generalized notion of frames designed with image properties in mind, as alternatives to this parametrization. We show that frame-based ResNets and De…

2017-06-02abs ↗pdf ↗

The classification of isoparametric hypersurfaces with four principal curvatures in spheres in [2] hinges on a crucial characterization, in terms of four sets of equations of the 2nd fundamental form tensors of a focal submanifold, of an isoparametric hypersurface of the type constructed by Ferus, Karcher and Münzner. …

2008-03-09abs ↗pdf ↗

The choice of admissible trading strategies in mathematical modelling of financial markets is a delicate issue, going back to Harrison and Kreps (1979). In the context of optimal portfolio selection with expected utility preferences this question has been a focus of considerable attention over the last twenty years. We…

2009-10-20abs ↗pdf ↗

This research optimizes Andrews plots for better visual clarity in high-dimensional data.

problem Visualizing high-dimensional datasets with clarity and aesthetics.
method Developed a method to add spectral smoothing to Andrews plots to reduce visual clutter.
result Optimal spatial-spectral smoothing leads to more aesthetically pleasing and clutter-free visualizations.

A new optimizer preserves orthogonality constraints on matrices efficiently.

problem Optimization on Stiefel manifold with orthogonality constraints.
method Interplay between continuous and discrete dynamics leading to a gradient-based optimizer with momentum.
result The method optimizes matrices on Stiefel manifold efficiently and accurately.

Paper shows equivalence between two alignment methods and introduces a new algorithm.

problem Ensuring human alignment of large language models for useful, safe, and pleasant user experience.
method Introduces IPO-MD algorithm, showing equivalence between IPO and Nash-MD methods.
result Equivalence between IPO and Nash-MD methods proven when considering online version of IPO.

This is a prejudiced survey on the Ahlfors (extremal) function and the weaker {\it circle maps} (Garabedian-Schiffer's translation of "Kreisabbildung"), i.e. those (branched) maps effecting the conformal representation upon the disc of a {\it compact bordered Riemann surface}. The theory in question has some well-known…

2012-11-15abs ↗pdf ↗