Framework scores DeFi users based on liquidity and trading behavior.
problem Distinguishing between liquidity provision and active trading in DeFi.
method Rule-based decomposition, deep residual neural network, pool-level context.
result Deep residual neural network improves user scoring and risk assessment.
Most multi-class classifiers make their prediction for a test sample by scoring the classes and selecting the one with the highest score. Analyzing these prediction scores is useful to understand the classifier behavior and to assess its reliability. We present an interactive visualization that facilitates per-class an…
Urban traffic systems worldwide are suffering from severe traffic safety problems. Traffic safety is affected by many complex factors, and heavily related to all drivers' behaviors involved in traffic system. Drivers with aggressive driving behaviors increase the risk of traffic accidents. In order to manage the safety…
We introduce a new approach for comparing reinforcement learning policies, using Wasserstein distances (WDs) in a newly defined latent behavioral space. We show that by utilizing the dual formulation of the WD, we can learn score functions over policy behaviors that can in turn be used to lead policy optimization towar…
New method evaluates AI stock prediction systems based on decision-making processes.
problem Lack of evaluation for AI systems' decision-making processes.
method Scores intermediate decision process using large language models and closed-loop reinforcement learning feedback.
result Composite behavioral score correlates with Sharpe ratio and reduces prediction error.
Data-driven anomaly detection methods typically build a model for the normal behavior of the target system, and score each data instance with respect to this model. A threshold is invariably needed to identify data instances with high (or low) scores as anomalies. This presents a practical limitation on the applicabili…
This paper provides new insight into maximizing F1 scores in the context of binary classification and also in the context of multilabel classification. The harmonic mean of precision and recall, F1 score is widely used to measure the success of a binary classifier when one class is rare. Micro average, macro average, a…
This paper presents two cases of random banking data generators based on migration matrices and scoring rules. The banking data generator is a new hope in researches of finding the proving method of comparisons of various credit scoring techniques. There is analyzed the influence of one cyclic macro--economic variable …
Traditional approaches to ranking in web search follow the paradigm of rank-by-score: a learned function gives each query-URL combination an absolute score and URLs are ranked according to this score. This paradigm ensures that if the score of one URL is better than another then one will always be ranked higher than th…
The statistical leverage scores of a complex matrix A∈Cn×d record the degree of alignment between col(A) and the coordinate axes in Cn. These score are used in random sampling algorithms for solving certain numerical linear algebra problems. In this paper we present a max-plus algebr…
Study identifies key health behaviors linked to adolescent suicide attempts.
problem Understanding health behaviors associated with increased risk of adolescent suicide attempts.
method Cross-sectional data analysis using machine learning algorithms and logistic regression.
result Non-parametric Bayesian tree ensemble model outperforms other models, achieving 80.0% accuracy in goodness-of-fit and 78.2% in predictive accuracy.
Alternative app data improves credit scoring for underserved borrowers.
problem Improving credit scoring for low-wealth and young individuals.
method Use of alternative data from app-based marketplaces, validated with TreeSHAP method.
result Alternative data sources predict financial behavior better than traditional bureau data.
We introduce SADs to reveal how network architecture shapes score-based generative models.
problem Understanding and predicting the inductive biases of score-based generative models.
method Introducing Score Anisotropy Directions (SADs) to analyze network architecture.
result SADs reliably capture model behavior and correlate with performance.
DDSME outperforms SME in estimating multimodal distributions.
problem Efficiency of score matching in multimodal distributions.
method Diffusion-based denoising score matching (DDSME) compared to vanilla score matching (SME).
result DDSME avoids the error bound deterioration of SME with increasing mode separation.
AIPS improves ranking policy evaluation by adapting to diverse user behavior.
problem Inaccurate Off-Policy Evaluation of ranking policies due to high variance under diverse user behavior.
method Developed Adaptive IPS (AIPS) that adapts to different user behaviors and minimizes MSE.
result AIPS achieves minimum variance among unbiased estimators and provides significant empirical accuracy improvement.
AIMM-X monitors markets for suspicious behavior using transparent scoring.
problem Detecting market manipulation from benign mechanisms.
method Combines microstructure signals and public attention signals for anomaly detection.
result Transparent scoring allows tracing and understanding flagged windows.
Big data from phone calls improves credit scoring models and profits.
problem Improving credit scoring models to enhance financial inclusion.
method Combining call-detail records and traditional data to build scorecards using social network analytics.
result Combining call-detail records with traditional data significantly increases model performance and profit.
Deconfounding scores improve causal effect estimation with weak overlap.
problem Challenges in causal treatment effect estimation due to weak overlap in high-dimensional data.
method Propose deconfounding scores to preserve identification and target estimation while improving overlap.
result Prognostic scores are overlap-optimal under a broad family of generalized linear models with Gaussian features.
Scores political leanings in Web3 betting markets.
problem Understanding political motivations in decentralized prediction markets.
method Constructing PBLS from Polymarket data, analyzing 15k addresses, 4k events, 8k markets.
result Validated PBLS through internal and external comparisons, revealing political and profit motives.
Study shows how diffusion models learn on low-dimensional manifolds.
problem Learning efficiency of diffusion models on manifolds.
method Analyzes denoising score matching with random feature neural networks.
result Sample complexity scales linearly with intrinsic dimension, not ambient dimension.
To investigate the detection of students' behavioral engagement (On-Task vs. Off-Task), we propose a two-phase approach in this study. In Phase 1, contextual logs (URLs) are utilized to assess active usage of the content platform. If there is active use, the appearance information is utilized in Phase 2 to infer behavi…
Hierarchical VAEs detect out-of-distribution data by identifying low-level in-distribution features.
problem Out-of-distribution data often has in-distribution low-level features, leading to misleading likelihood estimates in deep generative models.
method Developed a fast, scalable, unsupervised likelihood-ratio score for out-of-distribution detection based on hierarchical variational autoencoders.
result Achieved state-of-the-art results on out-of-distribution detection across various data and model combinations.
Paper introduces OCRR Score for quantifying DeFi wallet credit risk.
problem Inability to assess credit risk in decentralized finance.
method Probabilistic measure based on historical and predictive on-chain activity.
result Dynamic adjustment of LTV and LT based on wallet risk profile.
Paper analyzes stability and forgetting in score-based generative models.
problem Understanding the stability and long-time behavior of generative models.
method Quantitative bounds on sampling error using stability and forgetting properties of the Markov chain.
result Provides practical consequences of stability and contraction mechanism in sampling.
Enhances survival analysis by separating population behavior from individual dynamics.
problem Improving the training and inference of survival analysis models for sparsely occurring events.
method Decouples survival analysis into an aggregated baseline hazard and independent survival scores.
result Achieves competitive performance and robust results without fine-tuning.
MAFLA improves sampling from heavy-tailed distributions using MH-inspired corrections.
problem Sampling from heavy-tailed and multimodal distributions when neither target nor proposal densities can be evaluated.
method Metropolis-Adjusted Fractional Langevin Algorithm (MAFLA) with Score Balance Matching.
result MAFLA significantly improves finite-time sampling accuracy over unadjusted fractional Langevin dynamics.
Unified framework for generating heavy-tailed distributions.
problem Extending SGMs to heavy-tailed targets.
method Combining early stopping with initialization for diffusion, and normalizing flows for generation.
result Unified generative framework with theoretical guarantees for heavy-tailed distributions.
This research analyzes and accelerates score-based diffusion models using discretization and Hessian information.
problem Theoretical foundations and convergence analysis of score-based diffusion models.
method Investigation of various discretization schemes, including Euler, exponential integrators, and midpoint randomization. Proposal of an accelerated sampler based on local linearization method.
result Hessian-based approach achieves faster convergence rates of order $\widetilde{\mathcal{O}}\left(\frac{1}{\varepsilon}
ight)$, significantly improving upon vanilla diffusion models.
This paper is devoted to the bipartite ranking problem, a classical statistical learning task, in a high dimensional setting. We propose a scoring and ranking strategy based on the PAC-Bayesian approach. We consider nonlinear additive scoring functions, and we derive non-asymptotic risk bounds under a sparsity assumpti…
SCORE resolves the robustness vs accuracy trade-off by redefining robust error.
problem The inherent trade-off between robustness and accuracy in adversarial training.
method SCORE defines local equivariance as the ideal robust behavior, leading to a new robust error metric.
result SCORE reconciles robustness and accuracy, improving model performance on RobustBench.
AI agents in experimental markets exhibit behavioral patterns that aggregate into market dynamics.
problem Understanding AI trading behavior and its impact on market dynamics.
method Experimental asset markets populated by AI agents trained on Large Language Models (LLMs).
result AI agents' behavior leads to market dynamics similar to human traders, including bubbles.
No policy can simultaneously be fully autonomous, optimally calibrated, and helpful, proving a trilemma.
problem Proving impossibility of a policy achieving maximum helpfulness, optimal calibration, and full autonomy.
method Geometric proof showing that adding any non-affine autonomy incentive to a strictly proper scoring rule destroys strict properness.
result The Behavioral Credibility Trilemma: no policy can achieve all three goals simultaneously.
Compressed imitation learning uses simplicity priors for efficient expert behavior copying.
problem Efficiently learn expert behaviors with minimal data.
method Utilizes policy simplicity as a prior for sample-efficient imitation learning.
result Significantly higher scores achieved with limited expert demonstrations.
Curious Replay improves model-based reinforcement learning agents' adaptability.
problem Existing model-based reinforcement learning agents struggle to adapt quickly to changing environments.
method Curious Replay uses a curiosity-based priority signal for prioritized experience replay tailored to model-based agents.
result Agents using Curious Replay achieve improved performance in exploration and on benchmarks.
Verifying probabilistic forecasts for extreme events is a highly active research area because popular media and public opinions are naturally focused on extreme events, and biased conclusions are readily made. In this context, classical verification methods tailored for extreme events, such as thresholded and weighted …
Credit scoring models support loan approval decisions in the financial services industry. Lenders train these models on data from previously granted credit applications, where the borrowers' repayment behavior has been observed. This approach creates sample bias. The scoring model (i.e., classifier) is trained on accep…
New method reveals true causal functions in nonlinear time series, not just scores.
problem Causal discovery in nonlinear time series often uses scalar edge scores, which hide true function-valued causal influence.
method Formalized function-valued causal influence for additive, contribution-decomposable architectures. Introduced a practical framework based on ICE for estimating causal response functions directly from trained models.
result Edges with indistinguishable scalar scores can exhibit qualitatively different functional behaviors.
We propose a method to visualize class similarity in large-scale classifiers.
problem Analyzing hierarchical structures and relationships in large-scale classification.
method Compute class similarity based on prediction scores and visualize the class similarity matrix.
result Visualizing class similarity matrices reveals hierarchical structures and relationships.
The paper examines the consistency of item embeddings in recommendation systems.
problem The relevance of averaging item embeddings for user or concept representation.
method Proposes an expected precision score to measure consistency and analyzes it theoretically and empirically.
result Real-world averages are less consistent for recommendation compared to theoretical assumptions.
Meta-learning framework for credit risk assessment of SMEs, aligning financial statement dates with evaluation dates.
problem Temporal misalignment of credit scoring models leading to bias and inconsistent predictions.
method Two-step temporal decomposition: static model for annual PDs, dynamic model for monthly PDs; stacking architecture to aggregate multiple models.
result Framework effectively captures credit risk evolution over time, improving temporal consistency and predictive stability.
Diffusion models accurately recover mixture weights from generated samples despite score function insensitivity.
problem Score-based generative models often fail to learn correct relative mode amplitudes (mixture weights) from generated samples.
method Relate diffusion score matching (DSM) loss to mixture weight estimation error, define diffusion score sensitivity index (DSSI), and prove its governing role in mixture weight recovery.
result Generated samples can accurately recover mixture weights from the DSM loss, even when the target score is insensitive to mixture weights.
Transformer models improve malware classification, especially for imbalanced datasets.
problem Imbalanced multiclass malware classification.
method Bagging-based random transformer forest (RTF) ensemble of pre-trained transformer models (BERT or CANINE).
result Ensemble of pre-trained transformer models achieves state-of-the-art F1-score of 0.6149 on a benchmark dataset.
Better methods to detect insider threats need new anticipatory analytics to capture risky behavior prior to losing data. In search of the best overall classifier, this work empirically scores 88 machine learning algorithms in 16 major families. We extract risk features from the large CERT dataset, which blends real net…
Synthetic data improves credit scoring models' performance without compromising borrower privacy.
problem Scarcity of real data for credit scoring models due to privacy concerns.
method Privacy-preserving training with synthetic data.
result Credit scoring models trained with synthetic data show a reduction of 3% in AUC and 6% in KS compared to real data models.
The health outcomes of high-need patients can be substantially influenced by the degree of patient engagement in their own care. The role of care managers includes that of enrolling patients into care programs and keeping them sufficiently engaged in the program, so that patients can attain various goals. The attainmen…
Study minimax risk of score estimation for log-concave distributions.
problem Minimizing risk in score estimation for log-concave distributions.
method Developed subclasses of log-concave densities and constructed a locally adaptive, multiscale estimator.
result Established minimax rates for score estimation over specific subclasses of log-concave densities.
Framework for controlling multiple risks in AI models.
problem Enforcing multiple risk constraints in generative AI models.
method Formalizes problem, introduces two dynamic programming algorithms.
result Achieves nearly tight control of all constraint risks under mild assumptions.
DLM-One speeds up language generation by 500x with continuous models.
problem Efficiently generating text sequences in natural language processing.
method Score-distillation of continuous diffusion language models.
result Achieves up to 500x speedup in inference time with competitive performance.