A new probabilistic approach improves deep metric learning by considering image uncertainties and class-specific variances.
problem Proxy-based deep metric learning struggles with image uncertainties and class-specific structures.
method Introduces non-isotropic probabilistic proxy-based deep metric learning using directional von Mises-Fisher distributions.
result Improves generalization performance and competitive on standard benchmarks.
Proxy measures in competitive systems lead to corruption and inefficiency.
problem Corruption of proxy measures in competitive systems.
method Agent-based model integrating insights from complex systems, contest theory, behavioral economics, and cultural evolution.
result Proxy measures lead to corruption and convergence towards an equilibrium level of corruption.
A scalable method for deep metric learning using chance constraints.
problem Improving deep metric learning by addressing feasibility issues.
method Relating DML to chance constraints, reformulating as a feasibility problem, and iteratively training proxies.
result The method effectively improves deep metric learning performance across multiple benchmarks.
A data proxy reduces NAS computation cost by preserving key examples.
problem High computation cost in Neural Architecture Search (NAS).
method Measuring example importance based on relative accuracy ranking and creating a data proxy.
result Preserves almost same relative accuracy ranking with 10-20x smaller data proxy.
We propose parametric copulas that capture serial dependence in stationary heteroskedastic time series. We develop our copula for first order Markov series, and extend it to higher orders and multivariate series. We derive the copula of a volatility proxy, based on which we propose new measures of volatility dependence…
Estimates proxy-based inference adjustments for distribution shifts.
problem Imperfect proxy data leads to biased inference.
method Empirical calibration of proxy-primary metric discrepancy as a random effect.
result Empowers inference without individual-level response data.
Single proxy variable helps estimate causal effects from confounders.
problem Estimating causal effects from treatment to outcome when unobserved confounders are present.
method Assumes a single, potentially multi-dimensional proxy variable of the unobserved confounder and a known mechanism generating the proxy from the confounder. Proves causal effects are identifiable under completeness assumption.
result Causal effects are identifiable under SPICE assumption.
As data sets grow in size, the ability of learning methods to find structure in them is increasingly hampered by the time needed to search the large spaces of possibilities and generate a score for each that takes all of the observed data into account. For instance, Bayesian networks, the model chosen in this paper, ha…
OT-ICA uses optimal transport to find independent components, outperforming traditional methods.
problem Finding independent components from linear mixtures of signals.
method OT-ICA uses the squared Wasserstein distance to maximize non-Gaussianity, optimizing projections via gradient descent.
result OT-ICA outperforms traditional proxy-based methods in various applications.
ProxySHAP approximates Shapley and Banzhaf interactions efficiently.
problem Efficient estimation of complex machine learning interactions.
method ProxySHAP combines tree-based proxy models with residual correction.
result ProxySHAP achieves state-of-the-art interaction approximation quality.
Within the Own Risk and Solvency Assessment framework, the Solvency II directive introduces the need for insurance undertakings to have efficient tools enabling the companies to assess the continuous compliance with regulatory solvency requirements. Because of the great operational complexity resulting from each comple…
New framework uses geometry of embeddings to predict robustness.
problem Monitoring robustness in models without OOD labels.
method Constructs graphs from embeddings, measures spectral complexity and curvature.
result Representation geometry predicts robustness reliably.
Regulators require financial institutions to estimate counterparty default risks from liquid CDS quotes for the valuation and risk management of OTC derivatives. However, the vast majority of counterparties do not have liquid CDS quotes and need proxy CDS rates. Existing methods cannot account for counterparty-specific…
This paper evaluates and improves metrics for identifying important features in machine learning models.
problem Evaluation metrics for explainable AI are limited by multicollinearity and model accuracy.
method Proposes Expected Accuracy Interval (EAI) to predict model accuracy with multicollinearity.
result EAI is a useful metric for identifying important features in models with multicollinearity.
CMCO provides robust uncertainty estimates for neural operators without retraining.
problem Uncertainty quantification in deep learning for real-time virtual sensing.
method Unified Monte Carlo dropout and split conformal prediction in DeepONet.
result Near-nominal empirical coverage in diverse applications.
proxymate diagnoses and corrects proxy estimates for reliable inference.
problem Systematic bias in proxy estimates can lead to invalid inference on primary outcomes.
method Four-level framework for proxy validation and adjustment, including diagnostic checks and targeted corrections.
result Facilitated quick decision making on thousands of experiments at Meta.
New analysis shows SNG's effectiveness in small samples.
problem Limited understanding of SNG in small data settings.
method Sketch-and-project analysis of SNG.
result Global convergence and rate characterization for SNG.
Proposes CoPO, a new policy optimization method for competitive games.
problem Designing efficient optimization methods for competitive Markov decision processes.
method Competitive policy optimization (CoPO) approach that exploits game-theoretic nature of competitive games.
result Stable optimization, convergence to sophisticated strategies, and higher scores compared to baseline methods.
Kaggle competitions offer valuable insights for business forecasting.
problem Lack of attention to Kaggle competitions in academic forecasting studies.
method Review of results from six Kaggle competitions featuring real-life business forecasting tasks.
result Global ensemble models outperform local single models in Kaggle competitions.
Enhanced visual feature attribution via adaptive baseline weighting.
problem IG's sensitivity to baseline images leads to noisy or unstable explanations.
method Weighted Integrated Gradients (WG) evaluates and weights baselines for improved reliability.
result WG improves over Expected Gradients (EG) by up to 36% across various models.
Paper tackles fairness in algorithms by predicting protected class from auxiliary data.
problem Protected class membership is often unobserved in data, leading to unfair algorithmic decisions.
method Use auxiliary datasets to predict protected class from proxy variables and provide characterizations of possible disparities.
result Common disparity measures are generally unidentifiable with auxiliary data, highlighting the need for robust assessments.
The origin of economic crises is a key problem for economics. We present a model of long-run competitive markets to show that the multiplicity of behaviors in an economic system, over a long time scale, emerge as statistical regularities (perfectly competitive markets obey Bose-Einstein statistics and purely monopolist…
New framework promotes reproducible, domain-agnostic reinforcement learning algorithms.
problem Domain-specific, compute-resource-maximizing, and non-reproducible participant solutions in reinforcement learning competitions.
method Submission retraining, domain randomization, desemantization through domain obfuscation, and compute/environment-sample budget limitation.
result Participant submissions are reproducible, non-specific to the competition environment, and sample/resource efficient.
The real estate is a pillar industry of China's national economy. Due to changes in policy and market conditions, the real estate companies are facing greater pressures to survive in a competitive environment. They must improve their financial competitiveness. Based on the conceptual framework of financial competitiven…
Google Brain competition on adversarial attacks and defenses.
problem Developing methods to generate and defend against adversarial examples.
method Organized a competition to encourage new adversarial attack and defense methods.
result Several top teams developed innovative methods in adversarial attacks and defenses.
First ABAW 2020 Competition analyzes affective behavior tasks.
problem Automatic analysis of valence-arousal, basic expressions, and action units in real-world scenarios.
method Provided Aff-Wild2 database, described Challenges, evaluation metrics, and top-performing systems.
result Demonstrated the feasibility of automatic affective behavior analysis in real-world settings.
Study examines machine learning competitions' impact on AI development.
problem Fostering innovation and skill development in AI.
method Analysis of major competition platforms, workflows, and participant demographics.
result MLCs promote collaboration, reproducibility, and continuous innovation in AI.
Bayesian rating system for large competitions improves prediction and efficiency.
problem Rating systems for large, competitive events like online programming contests.
method Developed a Bayesian rating system for many participants, proving robustness and runtime.
result The system outperforms existing systems in accuracy and computation speed.
MineRL Competition reduced reinforcement learning sample needs.
problem Sample inefficiency in reinforcement learning.
method Human demonstrations and imitation learning integrated into reinforcement learning algorithms.
result Top solutions used deep reinforcement learning and imitation learning.
This paper evaluates financial competitiveness of Indian real estate companies using entropy method.
problem Improving financial competitiveness of Indian real estate companies in a competitive market.
method Financial competitiveness evaluation index system using key financial ratios and a scoring system.
result Companies with high scores have strong profitability and operational capacity, while those with lower scores struggle with solvency and working capital.
Arena model predicts competition outcomes without rating many individuals.
problem Predicting competition outcomes without extensive individual ratings.
method Parametric arena model exploiting competition structure and uncertainty quantification.
result Invariant Bayes estimator and consistent uncertainty estimations.
Paper tackles online optimization with memory and competitive control.
problem Minimizing hitting and switching costs in online optimization problems.
method Optimistic Regularized Online Balanced Descent algorithm.
result Achieves a constant, dimension-free competitive ratio.
This paper offers advice for designing and analyzing data competitions.
problem Overfitting in data competitions can limit the learning outcomes.
method Strategic design of data sets and post-competition analysis using GLMs.
result Richer and more informative summaries enhance the interpretation of results.
In this paper, the optimal pricing strategy in Avellande-Stoikov's for a monopolistic dealer is extended to a general situation where multiple dealers are present in a competitive market. The dealers' trading intensities, their optimal bid and ask prices and therefore their spreads are derived when the dealers are info…
Study competitive agents' optimal consumption and investment strategies with relative performance criteria.
problem Optimizing consumption and investment strategies for multiple agents with relative performance considerations.
method Derived a closed-form solution for an n-player game and mean field game, analyzing the impact of risk tolerance and competitiveness parameters. result Unique equilibria found, showing nonlinear and non-monotone dependence on agents' risk tolerance and competitiveness parameters.
Model predicts growth competition on curved surfaces.
problem Growth dynamics of two subsets on Riemannian manifolds.
method Modeling growth rates on spherically symmetric Riemannian manifolds.
result Conditions for bounded or unbounded growth on different manifolds.
Market competition depends on computational complexity, P != NP makes it impossible.
problem Competitive market outcomes require computational intractability.
method Analyzes the computational hardness of collusion detection in markets.
result If P != NP, collusion detection is computationally infeasible, making collusion unstable.
The M5 competition tackles overdispersed retail sales forecasting with GAMLSS.
problem Overdispersed and zero-inflated retail sales data.
method Distributional forecasting using GAMLSS framework.
result GAMLSS provides better probabilistic forecasting for count data.
Model predicts competition between similar products in sales.
problem Predicting cannibalization between similar products in sales.
method Developed a neural network model that computes a 'competitiveness' function based on product features.
result The model outperforms traditional methods in predicting market share.
Improved forecasting in daily time series competition using a correlator method.
problem Forecasting daily time series with data leakage issues.
method Ensemble of five statistical forecasting methods and a correlator method.
result The correlator method was responsible for most of the gains over naive forecasting.
Politicians world-wide frequently promise a better life for their citizens. We find that the probability that a country will increase its {\it per capita} GDP ({\it gdp}) rank within a decade follows an exponential distribution with decay constant λ=0.12. We use the Corruption Perceptions Index (CPI) and the Global …
We introduce an irreversible discrete multiplicative process that undergoes Bose-Einstein condensation as a generic model of competition. New players with different abilities successively join the game and compete for limited resources. A player's future gain is proportional to its ability and its current gain. The the…
The study assesses how market competitiveness affects electricity price forecasting.
problem Impact of market competitiveness on electricity price estimation.
method Used a multi-layer perception model with back propagation and Levenberg-Marquardt mechanism, incorporating market power indices and other variables.
result Market power indices enhance forecasting accuracy of daily electricity prices.
We present a broad agenda for meaningful banking regulation reform aiming the creation of evolutive competitive environment to maximize the effectiveness of international financial system through the introduction of fair competition process among the banks in free market capitalism. We assume that the international fin…
FLAIR measures LP competitiveness in AMMs, improving LP performance evaluations.
problem LP returns are affected by both market risk and competitive strategies.
method Introduces FLAIR metric to quantify LP competitiveness and assesses its impact on LP returns.
result FLAIR captures dynamic behavior of LPs and differentiates between active provisioning strategies.
Kaggle chronicles 15 years of competitions, innovation, and data science.
problem Exploring 15 years of data science competitions and innovations.
method Longitudinal trend analysis and exploratory data analysis of millions of kernels and discussion threads.
result Kaggle is a growing platform with diverse use cases and adaptable Kagglers.
A competition increases financial transaction models' robustness against attacks.
problem Neural networks used by banks are vulnerable to adversarial attacks in financial transaction data.
method A novel competition where participants propose attacks and defenses, simulating real-world conditions.
result Participants' strategies and outcomes provide insights into improving financial transaction models' robustness.
This work bridges competitive learning with gradient-based learning for faster feature extraction.
problem Lack of powerful feature extractors in competitive learning methods.
method Introduces gradient-based competitive layers for feature extraction.
result Demonstrates theoretical equivalence and faster convergence of gradient-based competitive layers.